Papers › Image Safeguarding: Reasoning with Conditional Vision Language Model and Obfuscating...

Image Safeguarding: Reasoning with Conditional Vision Language Model and Obfuscating Unsafe Content Counterfactually

19 Jan 2024arXiv:2401.11035archive 2025-07-28

Mazal Bethany, Brandon Wherry, Nishant Vishwamitra, Peyman Najafirad

Social media platforms are being increasingly used by malicious actors to share unsafe content, such as images depicting sexual activity, cyberbullying, and self-harm. Consequently, major platforms use artificial intelligence (AI) and human moderation to obfuscate such images to make them safer. Two critical needs for obfuscating unsafe images is that an accurate rationale for obfuscating image regions must be provided, and the sensitive regions should be obfuscated (\textit{e.g.} blurring) for users' safety. This process involves addressing two key problems: (1) the reason for obfuscating unsafe images demands the platform to provide an accurate rationale that must be grounded in unsafe image-specific attributes, and (2) the unsafe regions in the image must be minimally obfuscated while still depicting the safe regions. In this work, we address these key issues by first performing visual reasoning by designing a visual reasoning model (VLM) conditioned on pre-trained unsafe image classifiers to provide an accurate rationale grounded in unsafe image attributes, and then proposing a counterfactual explanation algorithm that minimally identifies and obfuscates unsafe regions for safe viewing, by first utilizing an unsafe image classifier attribution matrix to guide segmentation for a more optimal subregion segmentation followed by an informed greedy search to determine the minimum number of subregions required to modify the classifier's output based on attribution score. Extensive experiments on uncurated data from social networks emphasize the efficacy of our proposed method. We make our code available at: https://github.com/SecureAIAutonomyLab/ConditionalVLM

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2401.11035")

Code

Syntology Ran 12 of 16 code samples harvested from 1 repository linked to this paper; 4 have no recorded run. Of those that ran: 12 ran with no contract checked.

By repository: official repository: 16 samples from 1 repository, 12 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

secureaiautonomylab/conditionalvlm officialmentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

16 samples harvested; 12 ran; 0 honoured the contract we drafted; 4 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

12ran
4unverified

Licence: 0 of the 16 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from SecureAIAutonomyLab/ConditionalVLM. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

cam_processor_for_segments SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/re_alogirthms.py official repository ran MIT (permissive) · 23cf764b6ef7887d · report
conditional_prompt SecureAIAutonomyLab/ConditionalVLM/data_scripts/parallel_evaluation_pass1_llama2.py official repository ran MIT (permissive) · 621d1dd76acb359f · report
conditional_prompt SecureAIAutonomyLab/ConditionalVLM/data_scripts/step1_generate_instruct_parallel.py official repository ran MIT (permissive) · ccf528c84bf44e64 · report
create_train_objs SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/trainer.py official repository ran MIT (permissive) · dc422009a87cede8 · report
csv_mask_to_numpy SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/bass_functions.py official repository ran MIT (permissive) · 5abba8fa7da75d50 · report
csv_mask_to_numpy_SAM SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/bass_functions.py official repository ran MIT (permissive) · a9bfb48da31a8195 · report
get_feature_masks SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/re_alogirthms_unsafe.py official repository ran MIT (permissive) · 754eb64511d7672f · report
get_first_word SecureAIAutonomyLab/ConditionalVLM/data_scripts/step2_human_verification.py official repository ran fingerprinted MIT (permissive) · 2288a760079fcb43 · report
load_json_file SecureAIAutonomyLab/ConditionalVLM/data_scripts/parallel_evaluation_pass1_llama2.py official repository ran MIT (permissive) · df6d89d388fe4133 · report
parse_response SecureAIAutonomyLab/ConditionalVLM/data_scripts/step2_human_verification.py official repository ran MIT (permissive) · d7840e6c2b484338 · report
segmentation_info SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/re_alogirthms.py official repository ran MIT (permissive) · df4461bb26ce6c37 · report
splice_data_based_on_rank SecureAIAutonomyLab/ConditionalVLM/data_scripts/parallel_evaluation_pass1_llama2.py official repository ran MIT (permissive) · faf3a939d9923799 · report
create_dataloaders_MNIST SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/trainer.py official repository unverified MIT (permissive) · 232d178fceae3ade · report
create_dataloaders_MNIST_fashion SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/trainer.py official repository unverified MIT (permissive) · 65ba7c82b3357718 · report
main SecureAIAutonomyLab/ConditionalVLM/CSE/src/cse/__main__.py official repository unverified MIT (permissive) · 2684e3caff3c9539 · report
safe_or_unsafe_and_dataset_type SecureAIAutonomyLab/ConditionalVLM/data_scripts/step0_instruct_data_gen.py official repository unverified MIT (permissive) · a0ef73012388f178 · report

Tasks

Counterfactual ExplanationLanguage ModelingLanguage ModellingVisual Reasoning

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections