The data is organized into the following directory structure: images/ train/ CLEVR_train_000000.png CLEVR_train_000001.png [...] CLEVR_train_069999.png val/ CLEVR_val_000000.png [...] CLEVR_val_014999.png test/ CLEVR_test_000000.png [...] CLEVR_test_014999.png scenes/ CLEVR_train_scenes.json CLEVR_val_scenes.json questions/ CLEVR_train_questions.json CLEVR_val_questions.json CLEVR_test_questions.json SCENE FILE FORMAT Each of the scene files has the following format: { "info": , "scenes": [] } { "split": , "version": , "date": , "license": , } { "spit": , "image_index": , "image_filename": , "directions": { "left": [list of 3 numbers x, y, z], "right": [list of 3 numbers x, y, z], "front": [list of 3 numbers x, y, z], "behind": [list of 3 numbers x, y, z], "below": [list of 3 numbers x, y, z], "above": [list of 3 numbers x, y, z] }, "objects": [], "relations": { "left": , "right": , "front": , "behind": } } Relationships are stored as adjacency lists, which are lists of lists of integers. If s is a object, then s['relations']['left'][i] is a list of indices for objects which are left of s['objects'][i]. In other words, s['objects'][j] is left of s['objects'][i] if and only if j is in s['relations']['left'][i]. { "3d_coords": [list of 3 numbers x, y, z], "pixel_coords": [list of 3 numbers x, y, z], "rotation": , "size': , "color": , "material": , "shape": } QUESTION FILE FORMAT Each of the question files has the following format: { "info": , "questions": [] } { "split": , "version": , "date": , "license": } { "split": , "image_index": , "image_filename": , "question": , "answer": , "program": [], "question_family_index': , } Answers and programs are omitted from the test data. { "function": , "inputs": [list of integer], "value_inputs": [list of strings], } Programs are represented as lists of functions. Each function may take as input both literal values (given in "value_inputs") and output from other functions (given in "inputs"). Functions are guaranteed to be sorted topologically, so that j in program[i]['inputs'] if and only if j < i. As a simple example, consider the question "How many blue cubes are there?" The program representation for this question would be: [ { "function": "scene", "inputs": [], "value_inputs": [] }, { "function": "filter_color", "inputs": [0], "value_inputs": ["blue"] }, { "function": "filter_shape", "inputs": [1], "value_inputs": ["cube"] }, { "function": "count", "inputs": [2], "value_inputs": [] } ] Note that all programs contain one or more "scene" functions; this is a special function that takes no inputs, and outputs the set of all objects in the scene.