{"id":8,"date":"2025-05-06T17:13:35","date_gmt":"2025-05-06T17:13:35","guid":{"rendered":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/?page_id=8"},"modified":"2025-12-13T04:05:00","modified_gmt":"2025-12-13T04:05:00","slug":"experiments","status":"publish","type":"page","link":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/","title":{"rendered":"Methodology"},"content":{"rendered":"\n

Our approach intends to experimentally evaluate the robustness of monocular depth estimation (MDE) models. Specifically, we seek to develop a diagnostic toolbox that can allow you to systematically sample failure modes for common MDEs. This objective can be effectively seen below.<\/p>\n\n\n

\n
\"\"<\/figure>\n<\/div>\n\n\n

Camera Parameterization<\/h1>\n\n\n\n

To identify failures in an MDE model, we parameterize the camera with nine parameters: six for orientation, R<\/mi>=<\/mo>{<\/mo>r<\/mi>1<\/mn><\/msub>,<\/mo>\u2026<\/mo>,<\/mo>r<\/mi>6<\/mn><\/msub>}<\/mo><\/mrow>R = \\{r_1, \\dots, r_6\\}<\/annotation><\/semantics><\/math>R={r1\u200b,\u2026,r6\u200b}, and three for position, \u03b4<\/mi>=<\/mo>{<\/mo>\u03b4<\/mi>x<\/mi><\/msub>,<\/mo>\u03b4<\/mi>y<\/mi><\/msub>,<\/mo>\u03b4<\/mi>z<\/mi><\/msub>}<\/mo><\/mrow>\\delta = \\{\\delta_x, \\delta_y, \\delta_z\\}<\/annotation><\/semantics><\/math>. Following prior work, we use S<\/mi>O<\/mi><\/mrow>(<\/mo>3<\/mn>)<\/mo><\/mrow>\\mathrm{SO}(3)<\/annotation><\/semantics><\/math> for rotation due to its smoother optimization landscape .<\/p>\n\n\n\n

We also needed to pick a good camera parameterization to ensure that the model optimizes well. Specifically, the SO(3) parameterization is prone to many local minimas and unstable optimization gradients. To tackle this, we use a R6 overp-arameterization defined as,<\/p>\n\n\n\n

r<\/mi>^<\/mo><\/mover>1<\/mn><\/msub>=<\/mo>r<\/mi>1<\/mn><\/msub>\u2016<\/mi>r<\/mi>1<\/mn><\/msub>\u2016<\/mi><\/mrow><\/mfrac>,<\/mo><\/mspace>r<\/mi>^<\/mo><\/mover>2<\/mn><\/msub>=<\/mo>r<\/mi>2<\/mn><\/msub>\u2212<\/mo>(<\/mo>r<\/mi>^<\/mo><\/mover>1<\/mn><\/msub>\u22c5<\/mo>r<\/mi>2<\/mn><\/msub>)<\/mo>r<\/mi>^<\/mo><\/mover>1<\/mn><\/msub><\/mrow>\u2016<\/mi>r<\/mi>2<\/mn><\/msub>\u2212<\/mo>(<\/mo>r<\/mi>^<\/mo><\/mover>1<\/mn><\/msub>\u22c5<\/mo>r<\/mi>2<\/mn><\/msub>)<\/mo>r<\/mi>^<\/mo><\/mover>1<\/mn><\/msub>\u2016<\/mi><\/mrow><\/mfrac>,<\/mo><\/mspace>r<\/mi>^<\/mo><\/mover>3<\/mn><\/msub>=<\/mo>r<\/mi>^<\/mo><\/mover>1<\/mn><\/msub>\u00d7<\/mo>r<\/mi>^<\/mo><\/mover>2<\/mn><\/msub>,<\/mo><\/mspace>R<\/mi>=<\/mo>[<\/mo>r<\/mi>^<\/mo><\/mover>1<\/mn><\/msub>,<\/mo>r<\/mi>^<\/mo><\/mover>2<\/mn><\/msub>,<\/mo>r<\/mi>^<\/mo><\/mover>3<\/mn><\/msub>]<\/mo>.<\/mi><\/mrow>\\hat{r}_1 = \\frac{r_1}{\\|r_1\\|}, \\quad\n\\hat{r}_2 = \\frac{r_2 – (\\hat{r}_1 \\cdot r_2)\\hat{r}_1}{\\|r_2 – (\\hat{r}_1 \\cdot r_2)\\hat{r}_1\\|}, \\quad\n\\hat{r}_3 = \\hat{r}_1 \\times \\hat{r}_2,\\quad\nR = [\\hat{r}_1, \\hat{r}_2, \\hat{r}_3].<\/annotation><\/semantics><\/math><\/div>\n\n\n\n
\n\n\n\n

Baselines and Dataset Generation<\/h1>\n\n\n\n

Dataset Generation<\/h2>\n\n\n\n

While datasets such as 3D-FRONT and Hypersim exist, there remains a notable lack of diversity in synthetic indoor datasets that are compatible with differentiable renderers like PyTorch3D. To address this gap, we construct a small but diverse dataset of 10 texture-rich indoor scenes. Our pipeline integrates Blender and PyTorch3D, enabling us to bake high-quality textures in Blender into a single 8K texture map, while ensuring compatibility with PyTorch3D’s differentiable rendering framework.<\/p>\n\n\n\n

Our process is as follows:<\/p>\n\n\n\n

    \n
  1. Convert publicly available 3D assets originally made for Blender into formats compatible with PyTorch3D.<\/li>\n\n\n\n
  2. Merge all objects in each scene into a single mesh.<\/li>\n\n\n\n
  3. Generate a unified UV map using Blender\u2019s Smart UV unwrap.<\/li>\n\n\n\n
  4. Bake all object textures into a single 8K texture map using Blender\u2019s Cycles Renderer.<\/li>\n\n\n\n
  5. Load the processed mesh and texture into PyTorch3D while preserving spatial relationships.<\/li>\n\n\n\n
  6. Create a repository of converted 3D assets for direct rendering in PyTorch3D.<\/li>\n\n\n\n
  7. Streamline workflows for 3D rendering and analysis using the converted assets.<\/li>\n<\/ol>\n\n\n\n
    \"\"
    Our manually curated dataset in PyTorch3D. Samples were rendered and baked in Blender, then transfered to PyTorch3D.<\/figcaption><\/figure>\n\n\n\n

    Viewpoint Initialization<\/h2>\n\n\n\n
    \"\"<\/figure>\n\n\n\n

    We use a guided seeded random sampling approach to initialize our viewpoints. We begin by taking a point inside the scene mesh. Then at each iteration we find the distance to the closes mesh face, define a collider and then perturb the camera pose inside that “safety sphere”. We define this as,<\/p>\n\n\n\n

    r<\/mi>t<\/mi><\/msub>=<\/mo>min<\/mi>f<\/mi>\u2208<\/mo>\u2131<\/mi><\/mrow><\/munder>\u2061<\/mo><\/mspace>dist<\/mi>\u2061<\/mo>(<\/mo>\ud835\udc1c<\/mi>t<\/mi><\/msub>,<\/mo>f<\/mi>)<\/mo><\/mrow>\nr_t = \\min_{f \\in \\mathcal{F}} \\operatorname{dist}(\\mathbf{c}_t, f)<\/annotation><\/semantics><\/math><\/div>\n\n\n\n

    This process is followed by culling where we remove degenerate camera poses using semantic diversity in the scene. Finally, we run this for 100 iterations to sample 50 valid candidate poses. <\/p>\n\n\n\n

    \ud835\udc1c<\/mi>~<\/mo><\/mover>t<\/mi><\/msub>=<\/mo>\ud835\udc1c<\/mi>t<\/mi><\/msub>+<\/mo>\ud835\udf50<\/mi>,<\/mo><\/mspace>\ud835\udf50<\/mi>\u223c<\/mo>\ud835\udcb0<\/mi>(<\/mo>{<\/mo>\ud835\udc99<\/mi>\u2208<\/mo>\u211d<\/mi>3<\/mn><\/msup>:<\/mo>\u2016<\/mi>\ud835\udc99<\/mi>\u2016<\/mi>2<\/mn><\/msub>\u2264<\/mo>r<\/mi>t<\/mi><\/msub>}<\/mo>)<\/mo>.<\/mi><\/mrow>\\tilde{\\mathbf{c}}_t = \\mathbf{c}_t + \\boldsymbol{\\epsilon}, \\quad \n\\boldsymbol{\\epsilon} \\sim \\mathcal{U}\\big(\\{\\boldsymbol{x} \\in \\mathbb{R}^3 : \\|\\boldsymbol{x}\\|_2 \\le r_t\\}\\big).<\/annotation><\/semantics><\/math><\/div>\n\n\n\n
    R<\/mi>~<\/mo><\/mover>t<\/mi><\/msub>=<\/mo>R<\/mi>t-1<\/mtext><\/msub><\/mspace>\u03b4<\/mi>R<\/mi>.<\/mi><\/msub><\/mrow>\\tilde{R}_t = R_{\\text{t-1}} \\, \\delta R_.<\/annotation><\/semantics><\/math><\/div>\n\n\n\n

    The culling is defined as,<\/p>\n\n\n\n

    \u03b8<\/mi>t<\/mi><\/msub>=<\/mo>cos<\/mi>\u2212<\/mo>1<\/mn><\/mrow><\/msup>\u2061<\/mo>(<\/mo>\ud835\udc2f<\/mi>t<\/mi>\u22a4<\/mi><\/msubsup>\ud835\udc1d<\/mi>t<\/mi><\/msub>)<\/mo>><\/mo>\u03c4<\/mi>d<\/mi>e<\/mi>g<\/mi><\/mrow><\/msub><\/mrow>\\theta_t = \\cos^{-1}(\\mathbf{v}_t^\\top \\mathbf{d}_t) > \\tau_{deg}<\/annotation><\/semantics><\/math><\/div>\n\n\n\n

    Current Approach<\/h1>\n\n\n\n

    Beyond the baselines that we have sampled, our current approach is straightforward. Here, we use a differentiable rendering pipeline to optimize the camera pose based on the z-buffer depth prediction.<\/p>\n\n\n\n

    \"\"<\/figure>\n\n\n\n

    Instead of conventional pixel-wise regression losses such as \u2113<\/mi>1<\/mn><\/msub><\/mrow>\\ell_1<\/annotation><\/semantics><\/math>\u200b or \u2113<\/mi>2<\/mn><\/msub><\/mrow>\\ell_2<\/annotation><\/semantics><\/math>\u200b, we incorporate a patch-wise ordinal loss<\/em> into the objective function. The motivation for this design choice is that our primary concern is not strict numerical accuracy of depth values on an absolute scale, but rather the preservation of relative depth relationships<\/em> and the avoidance of distributional inconsistencies (e.g., incorrect foreground\u2013background ordering).<\/p>\n\n\n\n

    Instead of enforcing point-wise agreement, the patch-wise formulation evaluates depth relationships over local regions, encouraging consistent ordinal structure within each patch. This makes the loss more robust to global scale and shift ambiguities that commonly arise in monocular depth estimation. By operating at the patch level, the loss captures local geometric context and penalizes violations of relative depth ordering that are perceptually significant but may be weakly reflected in pixel-wise metrics.<\/p>\n\n\n\n

    Our final objective function is therefore defined as follows:<\/p>\n\n\n\n

    \u0394<\/mi><\/mrow>g<\/mi>=<\/mo>\ud835\udc9f<\/mi>R<\/mi>,<\/mo>\u03b4<\/mi><\/mrow><\/msub>(<\/mo>i<\/mi>)<\/mo>\u2212<\/mo>\ud835\udc9f<\/mi>R<\/mi>,<\/mo>\u03b4<\/mi><\/mrow><\/msub>(<\/mo>j<\/mi>)<\/mo>,<\/mo><\/mspace>\u0394<\/mi><\/mrow>p<\/mi>=<\/mo>\ud835\udc9f<\/mi>^<\/mo><\/mover>R<\/mi>,<\/mo>\u03b4<\/mi><\/mrow><\/msub>(<\/mo>i<\/mi>)<\/mo>\u2212<\/mo>\ud835\udc9f<\/mi>^<\/mo><\/mover>R<\/mi>,<\/mo>\u03b4<\/mi><\/mrow><\/msub>(<\/mo>j<\/mi>)<\/mo>,<\/mo><\/mrow>\\Delta g = \\mathcal{D}_{R, \\delta}(i) – \\mathcal{D}_{R, \\delta}(j), \\qquad \\Delta p = \\hat{\\mathcal{D}}_{R, \\delta}(i) – \\hat{\\mathcal{D}}_{R, \\delta}(j),<\/annotation><\/semantics><\/math><\/div>\n\n\n\n
    \u2112<\/mi>><\/mo><\/msub>=<\/mo>log<\/mi>\u2061<\/mo><\/mrow>(<\/mo>1<\/mn>+<\/mo>e<\/mi>\u2212<\/mo>\u0394<\/mi><\/mrow>p<\/mi><\/mrow><\/msup>)<\/mo>,<\/mo><\/mspace>\u2112<\/mi><<\/mo><\/msub>=<\/mo>log<\/mi>\u2061<\/mo><\/mrow>(<\/mo>1<\/mn>+<\/mo>e<\/mi>\u0394<\/mi><\/mrow>p<\/mi><\/mrow><\/msup>)<\/mo>,<\/mo><\/mspace>\u2112<\/mi>=<\/mo><\/msub>=<\/mo>|<\/mi>\u0394<\/mi><\/mrow>p<\/mi>|<\/mi>.<\/mi><\/mrow>\\mathcal{L}_{>} = \\log(1 + e^{-\\Delta p}), \\quad \n\\mathcal{L}_{<} = \\log(1 + e^{\\Delta p}), \\quad\n\\mathcal{L}_{=} = |\\Delta p|.<\/annotation><\/semantics><\/math><\/div>\n\n\n\n

    Then the overall patchwise loss is given as,<\/p>\n\n\n\n

    \u2112<\/mi>patch<\/mtext>(<\/mo>n<\/mi>)<\/mo><\/mrow><\/msubsup>=<\/mo>\u2112<\/mi>><\/mo>(<\/mo>n<\/mi>)<\/mo><\/mrow><\/msubsup>+<\/mo>\u2112<\/mi><<\/mo>(<\/mo>n<\/mi>)<\/mo><\/mrow><\/msubsup>+<\/mo>\u2112<\/mi>=<\/mo>(<\/mo>n<\/mi>)<\/mo><\/mrow><\/msubsup><\/mrow>M<\/mi><\/mfrac>.<\/mi><\/mrow>\\mathcal{L}_{\\text{patch}}^{(n)} =\n\\frac{\n\\mathcal{L}_{>}^{(n)} + \\mathcal{L}_{<}^{(n)} + \\mathcal{L}_{=}^{(n)}\n}{\nM\n}.<\/annotation><\/semantics><\/math><\/div>\n\n\n\n

    On top of the patchwise loss, we also define a collision regularization term,<\/p>\n\n\n\n

    d<\/mi>=<\/mo>min<\/mi>f<\/mi>\u2208<\/mo>\u2131<\/mi><\/mrow><\/munder>\u2061<\/mo><\/mspace>dist<\/mi>\u2061<\/mo>(<\/mo>\u03b4<\/mi>,<\/mo>f<\/mi>)<\/mo>,<\/mo><\/mrow>d = \\min_{f \\in \\mathcal{F}} \\operatorname{dist}(\\delta, f),<\/annotation><\/semantics><\/math><\/div>\n\n\n\n
    \u2112<\/mi>d<\/mi>i<\/mi>s<\/mi>t<\/mi><\/mrow><\/msub>=<\/mo>max<\/mi>\u2061<\/mo><\/mrow>(<\/mo>0<\/mn>,<\/mo>d<\/mi>t<\/mi>h<\/mi><\/mrow><\/msub>\u2212<\/mo>d<\/mi>)<\/mo>2<\/mn><\/msup><\/mrow>\\mathcal{L}_{dist} = \\max(0, d_{th} – d)^2<\/annotation><\/semantics><\/math><\/div>\n\n\n\n

    Giving us the final loss defined as,<\/p>\n\n\n\n

    \u2112<\/mi>d<\/mi>e<\/mi>p<\/mi>t<\/mi>h<\/mi><\/mrow><\/msub>=<\/mo>max<\/mi>R<\/mi>,<\/mo>\u03b4<\/mi><\/mrow><\/munder>\u2061<\/mo><\/mspace>\u03bb<\/mi>o<\/mi>r<\/mi>d<\/mi><\/mrow><\/msub>\u2112<\/mi>o<\/mi>r<\/mi>d<\/mi>i<\/mi>n<\/mi>a<\/mi>l<\/mi><\/mrow><\/msub>+<\/mo>min<\/mi>R<\/mi>,<\/mo>\u03b4<\/mi><\/mrow><\/munder>\u2061<\/mo><\/mspace>\u03bb<\/mi>d<\/mi>i<\/mi>s<\/mi>t<\/mi><\/mrow><\/msub>\u2112<\/mi>d<\/mi>i<\/mi>s<\/mi>t<\/mi><\/mrow><\/msub>,<\/mo><\/mrow>\\mathcal{L}_{depth} = \\max_{R, \\delta} \\lambda_{ord} \\mathcal{L}_{ordinal} + \\min_{R, \\delta} \\lambda_{dist} \\mathcal{L}_{dist},<\/annotation><\/semantics><\/math><\/div>\n\n\n\n

    Overall, this approach combines the advantages of various approaches as shown below.<\/p>\n\n\n\n

    \"\"<\/figure>\n\n\n\n

    Metrics<\/h2>\n\n\n\n

    To quantitatively assess the accuracy of predicted depth maps, we use commonly adopted metrics in monocular depth estimation that capture both relative and absolute errors.<\/p>\n\n\n\n

    1. Absolute Relative Error (AbsRel).<\/strong>AbsRel<\/mtext>=<\/mo>1<\/mn>N<\/mi><\/mfrac>\u2211<\/mo>i<\/mi>=<\/mo>1<\/mn><\/mrow>N<\/mi><\/munderover>\u2223<\/mi>d<\/mi>i<\/mi><\/msub>\u2212<\/mo>d<\/mi>i<\/mi>\u2217<\/mo><\/msubsup>\u2223<\/mi><\/mrow>d<\/mi>i<\/mi>\u2217<\/mo><\/msubsup><\/mfrac><\/mrow>\\text{AbsRel} = \\frac{1}{N} \\sum_{i=1}^{N} \\frac{|d_i – d_i^*|}{d_i^*}<\/annotation><\/semantics><\/math>where d<\/mi>i<\/mi><\/msub><\/mrow>d_i<\/annotation><\/semantics><\/math> and d<\/mi>i<\/mi>\u2217<\/mo><\/msubsup><\/mrow>d_i^*<\/annotation><\/semantics><\/math> are the predicted and ground-truth depth values for pixel i<\/mi><\/mrow>i<\/annotation><\/semantics><\/math>i, and N<\/mi><\/mrow>N<\/annotation><\/semantics><\/math> is the number of valid pixels. AbsRel measures the fractional error relative to the true depth, highlighting overall magnitude discrepancies.<\/p>\n\n\n\n

    2. Accuracy under Threshold.<\/strong><\/p>\n\n\n\n

    We specifically use the delta1 scores.<\/p>\n\n\n\n

    \u03b4<\/mi>n<\/mi><\/msub>=<\/mo>num of pixels such that <\/mtext>max<\/mi>\u2061<\/mo><\/mrow>(<\/mo>d<\/mi>i<\/mi><\/msub>d<\/mi>i<\/mi>\u2217<\/mo><\/msubsup><\/mfrac>,<\/mo>d<\/mi>i<\/mi>\u2217<\/mo><\/msubsup>d<\/mi>i<\/mi><\/msub><\/mfrac>)<\/mo><<\/mo>1.25<\/mn>n<\/mi><\/msup><\/mrow>N<\/mi><\/mfrac><\/mrow>\\delta_n = \\frac{\\text{num of pixels such that } \\max \\Big(\\frac{d_i}{d_i^*}, \\frac{d_i^*}{d_i}\\Big) < 1.25^n}{N}<\/annotation><\/semantics><\/math><\/div>\n\n\n\n

    This metric evaluates the percentage of pixels where the predicted depth is within a multiplicative factor 1.25<\/mn>n<\/mi><\/msup><\/mrow>1.25^n<\/annotation><\/semantics><\/math> of the ground truth. Common choices are n<\/mi>=<\/mo>1<\/mn>,<\/mo>2<\/mn>,<\/mo>3<\/mn><\/mrow>n = 1, 2, 3<\/annotation><\/semantics><\/math> capturing increasingly relaxed tolerances. Higher \u03b4<\/mi>n<\/mi><\/msub><\/mrow>\\delta_n<\/annotation><\/semantics><\/math> indicates better depth alignment.<\/p>\n\n\n\n

    3. Interpretation.<\/strong><\/p>\n\n\n\n

    Lower AbsRel<\/strong> indicates closer absolute agreement with ground truth depth values.<\/p>\n\n\n\n

    Higher <\/strong>\u03b4<\/mi>1<\/mn><\/msub>\\delta_1<\/annotation><\/semantics><\/math>\u200b<\/strong> indicates better relative ordering and consistency of depth predictions.<\/p>\n\n\n\n

    These metrics together provide a balanced view of depth prediction quality: AbsRel captures absolute scale errors, while \u03b4<\/mi>1<\/mn><\/msub>\\delta_1<\/annotation><\/semantics><\/math>\u200b captures relative depth consistency, which is particularly relevant when evaluating robustness to adversarial viewpoints or across different camera configurations.<\/p>\n\n\n\n
    \n","protected":false},"excerpt":{"rendered":"

    Our approach intends to experimentally evaluate the robustness of monocular depth estimation (MDE) models. Specifically, we seek to develop a diagnostic toolbox that can allow you to systematically sample failure modes for common MDEs. This objective can be effectively seen below. Camera Parameterization To identify failures in an MDE model, we parameterize the camera with … <\/p>\n

    Continue reading “Methodology”<\/span><\/a><\/p>\n","protected":false},"author":240,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-8","page","type-page","status-publish","hentry"],"yoast_head":"\nMethodology - Breaking Depth Estimation Models with Semantic Adversarial Attacks<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Methodology - Breaking Depth Estimation Models with Semantic Adversarial Attacks\" \/>\n<meta property=\"og:description\" content=\"Our approach intends to experimentally evaluate the robustness of monocular depth estimation (MDE) models. Specifically, we seek to develop a diagnostic toolbox that can allow you to systematically sample failure modes for common MDEs. This objective can be effectively seen below. Camera Parameterization To identify failures in an MDE model, we parameterize the camera with … Continue reading "Methodology"\" \/>\n<meta property=\"og:url\" content=\"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/\" \/>\n<meta property=\"og:site_name\" content=\"Breaking Depth Estimation Models with Semantic Adversarial Attacks\" \/>\n<meta property=\"article:modified_time\" content=\"2025-12-13T04:05:00+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-content\/uploads\/sites\/125\/2025\/12\/image.png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data1\" content=\"7 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/experiments\\\/\",\"url\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/experiments\\\/\",\"name\":\"Methodology - Breaking Depth Estimation Models with Semantic Adversarial Attacks\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/experiments\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/experiments\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/wp-content\\\/uploads\\\/sites\\\/125\\\/2025\\\/12\\\/image.png\",\"datePublished\":\"2025-05-06T17:13:35+00:00\",\"dateModified\":\"2025-12-13T04:05:00+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/experiments\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/experiments\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/experiments\\\/#primaryimage\",\"url\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/wp-content\\\/uploads\\\/sites\\\/125\\\/2025\\\/12\\\/image.png\",\"contentUrl\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/wp-content\\\/uploads\\\/sites\\\/125\\\/2025\\\/12\\\/image.png\",\"width\":776,\"height\":777},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/experiments\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Methodology\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/#website\",\"url\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/\",\"name\":\"Breaking Depth Estimation Models with Semantic Adversarial Attacks\",\"description\":\"Adithya Narayan, Utkarsh Ohja, Justin Theiss, Aayush Prakash, Fernando De la Torre\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/mscvprojects.ri.cmu.edu\\\/2025team12-2\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Methodology - Breaking Depth Estimation Models with Semantic Adversarial Attacks","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/","og_locale":"en_US","og_type":"article","og_title":"Methodology - Breaking Depth Estimation Models with Semantic Adversarial Attacks","og_description":"Our approach intends to experimentally evaluate the robustness of monocular depth estimation (MDE) models. Specifically, we seek to develop a diagnostic toolbox that can allow you to systematically sample failure modes for common MDEs. This objective can be effectively seen below. Camera Parameterization To identify failures in an MDE model, we parameterize the camera with … Continue reading \"Methodology\"","og_url":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/","og_site_name":"Breaking Depth Estimation Models with Semantic Adversarial Attacks","article_modified_time":"2025-12-13T04:05:00+00:00","og_image":[{"url":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-content\/uploads\/sites\/125\/2025\/12\/image.png","type":"","width":"","height":""}],"twitter_card":"summary_large_image","twitter_misc":{"Est. reading time":"7 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/","url":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/","name":"Methodology - Breaking Depth Estimation Models with Semantic Adversarial Attacks","isPartOf":{"@id":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/#website"},"primaryImageOfPage":{"@id":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/#primaryimage"},"image":{"@id":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/#primaryimage"},"thumbnailUrl":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-content\/uploads\/sites\/125\/2025\/12\/image.png","datePublished":"2025-05-06T17:13:35+00:00","dateModified":"2025-12-13T04:05:00+00:00","breadcrumb":{"@id":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/#primaryimage","url":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-content\/uploads\/sites\/125\/2025\/12\/image.png","contentUrl":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-content\/uploads\/sites\/125\/2025\/12\/image.png","width":776,"height":777},{"@type":"BreadcrumbList","@id":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/experiments\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/"},{"@type":"ListItem","position":2,"name":"Methodology"}]},{"@type":"WebSite","@id":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/#website","url":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/","name":"Breaking Depth Estimation Models with Semantic Adversarial Attacks","description":"Adithya Narayan, Utkarsh Ohja, Justin Theiss, Aayush Prakash, Fernando De la Torre","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"}]}},"_links":{"self":[{"href":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-json\/wp\/v2\/pages\/8","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-json\/wp\/v2\/users\/240"}],"replies":[{"embeddable":true,"href":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-json\/wp\/v2\/comments?post=8"}],"version-history":[{"count":18,"href":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-json\/wp\/v2\/pages\/8\/revisions"}],"predecessor-version":[{"id":137,"href":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-json\/wp\/v2\/pages\/8\/revisions\/137"}],"wp:attachment":[{"href":"https:\/\/mscvprojects.ri.cmu.edu\/2025team12-2\/wp-json\/wp\/v2\/media?parent=8"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}