SearcharxivSearch

arXiv subjects

Chetan Tiwari

Publications and source records attributed to Chetan Tiwari.

2 recordsLinked to original sources

Synthetic Homes: A Multimodal Generative AI Pipeline for Residential Building Data Generation under Data Scarcity

Computational models have emerged as powerful tools for multi-scale energy modeling research at the building and urban scale, supporting data-driven analysis across building and urban energy systems. However, these models require large amounts of building parameter data that is often inaccessible, expensive to collect, or subject to privacy constraints. We introduce a modular framework that applies generative Artificial Intelligence (AI) to construct simulation-ready building datasets from publicly available records and imagery. To improve the reliability of this framework, we evaluate both its AI components and its overall result. Our occlusion analysis demonstrates that for our selected images, LLaVA achieves greater visual focus than a GPT-based alternative for building image processing. We also assess plausibility of our results against a national reference dataset, finding that our synthetic data overlaps more than 95% for three of the four selected variables. This work aims to reduce dependence on costly or restricted data sources, lowering barriers to building-scale energy research and Machine Learning (ML)-driven urban energy modeling, thereby providing simulation-ready datasets intended to support downstream applications such as energy modeling, retrofit analysis, and urban-scale simulation under data scarcity.

cs.AI

An alignment problem

This work concerns an alignment problem that has applications in many geospatial problems such as resource allocation and building reliable disease maps. Here, we introduce the problem of optimally aligning $k$ collections of $m$ spatial supports over $n$ spatial units in a $d$-dimensional Euclidean space. We show that the 1-dimensional case is solvable in time polynomial in $k$, $m$ and $n$. We then show that the 2-dimensional case is NP-hard for 2 collections of 2 supports. Finally, we devise a heuristic for aligning a set of collections in the 2-dimensional case.

cs.DS