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.

Yida Wang 0001

dblp:17/1701-1 · DBLP profile ↗
← Back
10ranked-venue papers
10as first author
4since 2021 · last 2024
0000-0003-4519-9108ORCID · verified

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

Graphics, computer vision, multimedia, augmented reality and games · 8 · 8 first-author · 2 since 2021Artificial intelligence and machine learning · 6 · 6 first-author · 3 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
6 papers
3D vision · 50% Generative modeling · 21% Representation and self-supervised learning · 10%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › point cloud processing
point cloud completion
1.632022
SoftPool++: An Encoder-Decoder Network for Point Cloud Completion · Int. J. Comput. Vis. 2022
Learning Local Displacements for Point Cloud Completion · CVPR 2022
SoftPoolNet: Shape Descriptor for Point Cloud Completion and Classification · ECCV (3) 2020
Machine learning › Generative modeling
latent space optimization
0.812024
Self-Supervised Latent Space Optimization With Nebula Variational Coding · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Representation and self-supervised learning › representation learning › latent representation learning
variational encoding
0.812024
Self-Supervised Latent Space Optimization With Nebula Variational Coding · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.812024
Self-Supervised Latent Space Optimization With Nebula Variational Coding · IEEE Trans. Pattern Anal. Mach. Intell. 2024
Computer vision › 3D vision
point cloud processing
0.612022
Learning Local Displacements for Point Cloud Completion · CVPR 2022
Computer vision › 3D vision › point cloud processing › point cloud restoration
point cloud upsampling
0.612022
Learning Local Displacements for Point Cloud Completion · CVPR 2022
Computer vision › 3D vision › 3d scene understanding
semantic scene completion
0.412019
ForkNet: Multi-Branch Volumetric Semantic Completion From a Single Depth Image · ICCV 2019
Computer vision › 3D vision › 3d shape reconstruction
shape completion
0.412019
ForkNet: Multi-Branch Volumetric Semantic Completion From a Single Depth Image · ICCV 2019
Machine learning › Generative modeling
image generation
0.312018
Generative Model With Coordinate Metric Learning for Object Recognition Based on 3D Models · IEEE Trans. Image Process. 2018
Computer vision › Image recognition and object detection
object recognition
0.312018
Generative Model With Coordinate Metric Learning for Object Recognition Based on 3D Models · IEEE Trans. Image Process. 2018
Machine learning › Generative modeling › synthetic data generation
synthetic image generation
0.312018
Generative Model With Coordinate Metric Learning for Object Recognition Based on 3D Models · IEEE Trans. Image Process. 2018
Machine learning › Deep learning architectures and training
encoder-decoder architecture
0.212022
SoftPool++: An Encoder-Decoder Network for Point Cloud Completion · Int. J. Comput. Vis. 2022
Computer vision › 3D vision › point cloud analysis
point cloud classification
0.112020
SoftPoolNet: Shape Descriptor for Point Cloud Completion and Classification · ECCV (3) 2020
Machine learning › Transfer learning and domain adaptation
sim-to-real transfer
0.112018
Generative Model With Coordinate Metric Learning for Object Recognition Based on 3D Models · IEEE Trans. Image Process. 2018

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

metric learning · 1.1variational inference · 0.8self-supervised learning · 0.8transformer · 0.6soft pooling · 0.6skip connections · 0.6neighbor-pooling · 0.6local descriptors · 0.6encoder-decoder · 0.6shape descriptors · 0.4
YearPublicationVenuePosition
2024 RaNeuS: Ray-adaptive Neural Surface Reconstruction
abstract
Our objective is to leverage a differentiable radiance field e.g. NeRF to reconstruct detailed 3D surfaces in addition to producing the standard novel view renderings. There have been related methods that perform such tasks, usually by utilizing a signed distance field (SDF). However, the state-of-the-art approaches still fail to correctly reconstruct the small-scale details, such as the leaves, ropes, and textile surfaces. Considering that different methods formulate and optimize the projection from SDF to radiance field with a globally constant Eikonal regularization, we improve with a ray-wise weighting factor to prioritize the rendering and zero-crossing surface fitting on top of establishing a perfect SDF. We propose to adaptively adjust the regularization on the signed distance field so that unsatisfying rendering rays won’t enforce strong Eikonal regularization which is ineffective, and allow the gradients from regions with well-learned radiance to effectively back-propagated to the SDF. Consequently, balancing the two objectives in order to generate accurate and detailed surfaces. Additionally, concerning whether there is a geometric bias between the zero-crossing surface in SDF and rendering points in the radiance field, the projection becomes adjustable as well depending on different 3D locations during optimization. Our proposed RaNeuS1are extensively evaluated on both synthetic and real datasets, achieving state-of-the-art results on both novel view synthesis and geometric reconstruction.1Codes are released at https://github.com/wangyida/ra-neus.
Yida Wang 0001, David Joseph Tan, Nassir Navab, Federico Tombari
3DV1
2024 Self-Supervised Latent Space Optimization With Nebula Variational Coding
abstract
Deep learning approaches process data in a layer-by-layer way with intermediate (or latent) features. We aim at designing a general solution to optimize the latent manifolds to improve the performance on classification, segmentation, completion and/or reconstruction through probabilistic models. This paper proposes a variational inference model which leads to a clustered embedding. We introduce additional variables in the latent space, called nebula anchors, that guide the latent variables to form clusters during training. To prevent the anchors from clustering among themselves, we employ the variational constraint that enforces the latent features within an anchor to form a Gaussian distribution, resulting in a generative model we refer as Nebula Variational Coding (NVC). Since each latent feature can be labeled with the closest anchor, we also propose to apply metric learning in a self-supervised way to make the separation between clusters more explicit. As a consequence, the latent variables of our variational coder form clusters which adapt to the generated semantic of the training data, e.g., the categorical labels of each sample. We demonstrate experimentally that it can be used within different architectures designed to solve different problems including text sequence, images, 3D point clouds and volumetric data, validating the advantage of our proposed method.
Yida Wang 0001, David Joseph Tan, Nassir Navab, Federico Tombari
IEEE Trans. Pattern Anal. Mach. Intell.1
2022 Learning Local Displacements for Point Cloud Completion
abstract
We propose a novel approach aimed at object and semantic scene completion from a partial scan represented as a 3D point cloud. Our architecture relies on three novel layers that are used successively within an encoder-decoder structure and specifically developed for the task at hand. The first one carries out feature extraction by matching the point features to a set of pre-trained local descriptors. Then, to avoid losing individual descriptors as part of standard operations such as max-pooling, we propose an alternative neighbor-pooling operation that relies on adopting the feature vectors with the highest activations. Finally, upsampling in the decoder modifies our feature extraction in order to increase the output dimension. While this model is already able to achieve competitive results with the state of the art, we further propose a way to increase the versatility of our approach to process point clouds. To this aim, we introduce a second model that assembles our layers within a transformer architecture. We evaluate both architectures on object and indoor scene completion tasks, achieving state-of-the-art performance.
Yida Wang 0001, David Joseph Tan, Nassir Navab, Federico Tombari
CVPR1
2022 SoftPool++: An Encoder-Decoder Network for Point Cloud Completion
abstract
Abstract We propose a novel convolutional operator for the task of point cloud completion. One striking characteristic of our approach is that, conversely to related work it does not require any max-pooling or voxelization operation. Instead, the proposed operator used to learn the point cloud embedding in the encoder extracts permutation-invariant features from the point cloud via a soft-pooling of feature activations, which are able to preserve fine-grained geometric details. These features are then passed on to a decoder architecture. Due to the compression in the encoder, a typical limitation of this type of architectures is that they tend to lose parts of the input shape structure. We propose to overcome this limitation by using skip connections specifically devised for point clouds, where links between corresponding layers in the encoder and the decoder are established. As part of these connections, we introduce a transformation matrix that projects the features from the encoder to the decoder and vice-versa. The quantitative and qualitative results on the task of object completion from partial scans on the ShapeNet dataset show that incorporating our approach achieves state-of-the-art performance in shape completion both at low and high resolutions.
Yida Wang 0001, David Joseph Tan, Nassir Navab, Federico Tombari
Int. J. Comput. Vis.1
2020 SoftPoolNet: Shape Descriptor for Point Cloud Completion and Classification
Yida Wang 0001, David Joseph Tan, Nassir Navab, Federico Tombari
ECCV (3)1
2019 ForkNet: Multi-Branch Volumetric Semantic Completion From a Single Depth Image
abstract
We propose a novel model for 3D semantic completion from a single depth image, based on a single encoder and three separate generators used to reconstruct different geometric and semantic representations of the original and completed scene, all sharing the same latent space. To transfer information between the geometric and semantic branches of the network, we introduce paths between them concatenating features at corresponding network layers. Motivated by the limited amount of training samples from real scenes, an interesting attribute of our architecture is the capacity to supplement the existing dataset by generating a new training dataset with high quality, realistic scenes that even includes occlusion and real noise. We build the new dataset by sampling the features directly from latent space which generates a pair of partial volumetric surface and completed volumetric semantic surface. Moreover, we utilize multiple discriminators to increase the accuracy and realism of the reconstructions. We demonstrate the benefits of our approach on standard benchmarks for the two most common completion tasks: semantic 3D scene completion and 3D object completion.
Yida Wang 0001, David Joseph Tan, Nassir Navab, Federico Tombari
ICCV1
2018 Adversarial Semantic Scene Completion from a Single Depth Image
abstract
We propose a method to reconstruct, complete and semantically label a 3D scene from a single input depth image. We improve the accuracy of the regressed semantic 3D maps by a novel architecture based on adversarial learning. In particular, we suggest using multiple adversarial loss terms that not only enforce realistic outputs with respect to the ground truth, but also an effective embedding of the internal features. This is done by correlating the latent features of the encoder working on partial 2.5D data with the latent features extracted from a variational 3D auto-encoder trained to reconstruct the complete semantic scene. In addition, differently from other approaches that operate entirely through 3D convolutions, at test time we retain the original 2.5D structure of the input during downsampling to improve the effectiveness of the internal representation of our model. We test our approach on the main benchmark datasets for semantic scene completion to qualitatively and quantitatively assess the effectiveness of our proposal.
Yida Wang 0001, David Joseph Tan, Nassir Navab, Federico Tombari
3DV1
2018 Generative Model With Coordinate Metric Learning for Object Recognition Based on 3D Models
abstract
One of the bottlenecks in acquiring a perfect database for deep learning is the tedious process of collecting and labeling data. In this paper, we propose a generative model trained with synthetic images rendered from 3D models which can reduce the burden on collecting real training data and make the background conditions more realistic. Our architecture is composed of two sub-networks: a semantic foreground object reconstruction network based on Bayesian inference and a classification network based on multi-triplet cost training for avoiding overfitting on the monotone synthetic object surface and utilizing accurate information of synthetic images like object poses and lighting conditions which are helpful for recognizing regular photos. First, our generative model with metric learning utilizes additional foreground object channels generated from semantic foreground object reconstruction sub-network for recognizing the original input images. Multi-triplet cost function based on poses is used for metric learning which makes it possible to train an effective categorical classifier purely based on synthetic data. Second, we design a coordinate training strategy with the help of adaptive noise applied on the inputs of both of the concatenated sub-networks to make them benefit from each other and avoid inharmonious parameter tuning due to different convergence speeds of two sub-networks. Our architecture achieves the state-of-the-art accuracy of 50.5% on the ShapeNet database with data migration obstacle from synthetic images to real images. This pipeline makes it applicable to do recognition on real images only based on 3D models. Our codes are available at https://github.com/wangyida/gm-cml.
Yida Wang 0001, Weihong Deng
IEEE Trans. Image Process.1
2016 ZigzagNet: Efficient Deep Learning for Real Object Recognition Based on 3D Models
Yida Wang 0001, Xiuzhuang Zhou, Weihong Deng
ACCV (4)1
2016 Self-restraint object recognition by model based CNN learning
abstract
CNN has shown excellent performance on object recognition based on huge amount of real images. For training with synthetic data rendered from 3D models alone to reduce the workload of collecting real images, we propose a concatenated self-restraint learning structure lead by a triplet and softmax jointed loss function for object recognition. Locally connected auto encoder trained from rendered images with and without background used for object reconstruction against environment variables produces an additional channel automatically concatenated to RGB channels as input of classification network. This structure makes it possible training a softmax classifier directly from CNN based on synthetic data with our rendering strategy. Our structure halves the gap between training based on real photos and 3D model in both PASCAL and ImageNet database compared to GoogleNet.
Yida Wang 0001, Weihong Deng
ICIP1