Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohammad Samiul Arshad

dblp:276/6219 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2023
0000-0001-6271-7814ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
3D vision · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
3d reconstruction
0.712023
LIST: Learning Implicitly from Spatial Transformers for Single-View 3D Reconstruction · ICCV 2023
Computer vision › 3D vision
3d shape modeling
0.712023
LIST: Learning Implicitly from Spatial Transformers for Single-View 3D Reconstruction · ICCV 2023
Computer vision › 3D vision › 3d reconstruction › surface reconstruction › neural surface reconstruction
neural implicit surface reconstruction
0.712023
LIST: Learning Implicitly from Spatial Transformers for Single-View 3D Reconstruction · ICCV 2023
Computer vision › 3D vision › 3d reconstruction
single-view 3d reconstruction
0.712023
LIST: Learning Implicitly from Spatial Transformers for Single-View 3D Reconstruction · ICCV 2023

Methods — techniques the papers use, named apart from their topics

spatial transformer · 0.7signed distance function · 0.7implicit predictor · 0.7
YearPublicationVenuePosition
2023 LIST: Learning Implicitly from Spatial Transformers for Single-View 3D Reconstruction
abstract
Accurate reconstruction of both the geometric and topological details of a 3D object from a single 2D image embodies a fundamental challenge in computer vision. Existing explicit/implicit solutions to this problem struggle to recover self-occluded geometry and/or faithfully reconstruct topological shape structures. To resolve this dilemma, we introduce LIST, a novel neural architecture that leverages local and global image features to accurately reconstruct the geometric and topological structure of a 3D object from a single image. We utilize global 2D features to predict a coarse shape of the target object and then use it as a base for higher-resolution reconstruction. By leveraging both local 2D features from the image and 3D features from the coarse prediction, we can predict the signed distance between an arbitrary point and the target surface via an implicit predictor with great accuracy. Furthermore, our model does not require camera estimation or pixel alignment. It provides an uninfluenced reconstruction from the input-view direction. Through qualitative and quantitative analysis, we show the superiority of our model in reconstructing 3D objects from both synthetic and real-world images against the state of the art. Our source code is publicly available to the research community [13].
Mohammad Samiul Arshad, William J. Beksi
ICCV1
2023 IPVNet: Learning implicit point-voxel features for open-surface 3D reconstruction
Mohammad Samiul Arshad, William J. Beksi
J. Vis. Commun. Image Represent.1
2020 A Progressive Conditional Generative Adversarial Network for Generating Dense and Colored 3D Point Clouds
abstract
In this paper, we introduce a novel conditional generative adversarial network that creates dense 3D point clouds, with color, for assorted classes of objects in an unsupervised manner. To overcome the difficulty of capturing intricate details at high resolutions, we propose a point transformer that progressively grows the network through the use of graph convolutions. The network is composed of a leaf output layer and an initial set of branches. Every training iteration evolves a point vector into a point cloud of increasing resolution. After a fixed number of iterations, the number of branches is increased by replicating the last branch. Experimental results show that our network is capable of learning and mimicking a 3D data distribution, and produces colored point clouds with fine details at multiple resolutions.
Mohammad Samiul Arshad, William J. Beksi
3DV1