PhD student - Simon Fraser University
The paper presents a new method for generating vector floorplans using a diffusion model that improves upon existing methods. The approach uses a graph-conditioned floorplan generation approach with a Transformer architecture and outperforms state-of-the-art methods on the RPLAN dataset.
Mohammad Amin Shabani, Sepidehsadat Hosseini, and Yasutaka Furukawa
CVPR 2023
In this paper, we propose a general multi-scale framework that can be applied to the state-of-the-art transformer-based time series forecasting models (FEDformer, Autoformer, etc.).
Mohammad Amin Shabani, Amir Abdi, Lili Meng, and Tristan Sylvain
ICLR 2023
This paper proposes a novel vectorization algorithm for highdefinition floorplans with construction-level intricate architectural details, namely a blueprint.
Weilian Song, Mahsa Maleki Abyaneh, Mohammad Amin Shabani, and Yasutaka Furukawa
ACCV 2022
This paper proposes an extreme Structure from Motion (SfM) algorithm for residential indoor panoramas that have little to no visual overlaps. Only a single panorama is present in a room for many cases, making the task infeasible for existing SfM algorithms.
Mohammad Amin Shabani, Weilian Song, Makoto Odamaki, Hirochika Fujiki, and Yasutaka Furukawa
ICCV 2021
In this paper we study local vibration patterns at different image locations. We show that different locations in the image vibrate differently. We carefully aggregate local vibrations and produce a sound quality that improves state-of-the-art.
MA Shabani, L Samadfam, MA Sadeghi
BMVC 2017
We proposed a new method to create soft targets in different levels of complexity by obtaining the probabilities from the intermediate layers of the teacher network. Our method is specially designed for the cases that there is a large gap between the teacher and the student which makes it harder for the student to mimic the teacher.
MA Shabani
2019
The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph into 5-cycles was first considered by ES Mahmoodian and Maryam Mirzakhani (1995). They stated some necessary conditions and conjectured that those conditions are also sufficient. We show the conjecture is true under some conditions.
M Abdolmaleki, SG Ilchi, ES Mahmoodian, MA Shabani
arXiv preprint
A graph G is said to have property M(k) if it is not uniquely k-list colorable. We found bounds on M(k) for graphs embedded on surfaces, and obtain new results on planar graphs. We begin a general study of bounds on M(k) for regular graphs, as well as for graphs with varying list sizes.
M Abdolmaleki, J. P. Hutchinson, S. Gh. Ilchi, E. S. Mahmoodian, N Matsumoto, M. A. Shabani
Graphs and Combinatorics, 2018
