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

Ehsan Taghavi

dblp:136/1799 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
4since 2021 · last 2021
0000-0003-4946-4204ORCID · verified

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

Artificial intelligence and machine learning · 5 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-authorSystems, architecture and hardware · 2 · 2 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
5 papers
3D vision · 44% Segmentation and scene understanding · 22% Autonomous driving · 22%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision › point cloud segmentation
point cloud semantic segmentation
1.532021
Lite-HDSeg: LiDAR Semantic Segmentation Using Lite Harmonic Dense Convolutions · ICRA 2021
TORNADO-Net: mulTiview tOtal vaRiatioN semAntic segmentation with Diamond inceptiOn module · ICRA 2021
(AF)2-S3Net: Attentive Feature Fusion With Adaptive Feature Selection for Sparse Semantic Segmentation Network · CVPR 2021
Robotics › Autonomous driving
perception
1.022021
Lite-HDSeg: LiDAR Semantic Segmentation Using Lite Harmonic Dense Convolutions · ICRA 2021
(AF)2-S3Net: Attentive Feature Fusion With Adaptive Feature Selection for Sparse Semantic Segmentation Network · CVPR 2021
Computer vision › Segmentation and scene understanding
semantic segmentation
1.022021
TORNADO-Net: mulTiview tOtal vaRiatioN semAntic segmentation with Diamond inceptiOn module · ICRA 2021
(AF)2-S3Net: Attentive Feature Fusion With Adaptive Feature Selection for Sparse Semantic Segmentation Network · CVPR 2021
Computer vision › 3D vision › point cloud segmentation › LiDAR segmentation
LiDAR panoptic segmentation
0.512021
GP-S3Net: Graph-based Panoptic Sparse Semantic Segmentation Network · ICCV 2021
Robotics › Autonomous driving
LiDAR scene understanding
0.512021
Lite-HDSeg: LiDAR Semantic Segmentation Using Lite Harmonic Dense Convolutions · ICRA 2021
Computer vision › Segmentation and scene understanding
panoptic segmentation
0.512021
GP-S3Net: Graph-based Panoptic Sparse Semantic Segmentation Network · ICCV 2021
Computer vision › 3D vision › point cloud analysis
point cloud classification
0.412020
Adaptive Hierarchical Down-Sampling for Point Cloud Classification · CVPR 2020
Computer vision › 3D vision
point cloud processing
0.412020
Adaptive Hierarchical Down-Sampling for Point Cloud Classification · CVPR 2020
Machine learning › Efficient and distributed learning
efficient neural network design
0.112021
Lite-HDSeg: LiDAR Semantic Segmentation Using Lite Harmonic Dense Convolutions · ICRA 2021
Machine learning › Graph learning › graph neural network
graph convolutional network
0.112021
GP-S3Net: Graph-based Panoptic Sparse Semantic Segmentation Network · ICCV 2021
Computer vision › 3D vision › point cloud processing
LiDAR point cloud processing
0.112021
TORNADO-Net: mulTiview tOtal vaRiatioN semAntic segmentation with Diamond inceptiOn module · ICRA 2021
Machine learning › Graph learning › graph neural network › graph convolution
point cloud graph convolution
0.112020
Adaptive Hierarchical Down-Sampling for Point Cloud Classification · CVPR 2020

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

total variation loss · 0.5sparse convolution · 0.5resnet encoder-decoder · 0.5multi-view projection · 0.5lovász-softmax loss · 0.5graph convolutional network · 0.5encoder-decoder CNN · 0.5circular padding · 0.5attentive feature fusion · 0.5adaptive feature selection · 0.5
YearPublicationVenuePosition
2021 (AF)2-S3Net: Attentive Feature Fusion With Adaptive Feature Selection for Sparse Semantic Segmentation Network
abstract
Autonomous robotic systems and self driving cars rely on accurate perception of their surroundings as the safety of the passengers and pedestrians is the top priority. Semantic segmentation is one of the essential components of road scene perception that provides semantic information of the surrounding environment. Recently, several methods have been introduced for 3D LiDAR semantic segmentation. While they can lead to improved performance, they are either afflicted by high computational complexity, therefore are inefficient, or they lack fine details of smaller object instances. To alleviate these problems, we propose (AF)2-S3Net, an end-to-end encoder-decoder CNN network for 3D LiDAR semantic segmentation. We present a novel multibranch attentive feature fusion module in the encoder and a unique adaptive feature selection module with feature map re-weighting in the decoder. Our (AF)2-S3Net fuses the voxel-based learning and point-based learning methods into a unified framework to effectively process the potentially large 3D scene. Our experimental results show that the proposed method outperforms the state-of-the-art approaches on the large-scale nuScenes-lidarseg and SemanticKITTI benchmark, ranking 1ston both competitive public leaderboard competitions upon publication.
Ryan Razani, Ehsan Taghavi, Enxu Li
CVPR3
2021 GP-S3Net: Graph-based Panoptic Sparse Semantic Segmentation Network
abstract
Panoptic segmentation as an integrated task of both static environmental understanding and dynamic object identification, has recently begun to receive broad research interest. In this paper, we propose a new computationally efficient LiDAR based panoptic segmentation framework, called GP-S3Net. GP-S3Net is a proposal-free approach in which no object proposals are needed to identify the objects in contrast to conventional two-stage panoptic systems, where a detection network is incorporated for capturing instance information. Our new design consists of a novel instance-level network to process the semantic results by constructing a graph convolutional network to identify objects (foreground), which later on are fused with the back-ground classes. Through the fine-grained clusters of the foreground objects from the semantic segmentation back-bone, over-segmentation priors are generated and subsequently processed by 3D sparse convolution to embed each cluster. Each cluster is treated as a node in the graph and its corresponding embedding is used as its node feature. Then a GCNN predicts whether edges exist between each cluster pair. We utilize the instance label to generate ground truth edge labels for each constructed graph in order to supervise the learning. Extensive experiments demonstrate that GP-S3Net outperforms the current state-of-the-art approaches, by a significant margin across available datasets such as, nuScenes and SemanticPOSS, ranking 1ston the competitive public SemanticKITTI leaderboard upon publication.
Ryan Razani, Enxu Li, Ehsan Taghavi
ICCV4
2021 TORNADO-Net: mulTiview tOtal vaRiatioN semAntic segmentation with Diamond inceptiOn module
abstract
Semantic segmentation of point clouds is a key component of scene understanding for robotics and autonomous driving. In this paper, we introduce TORNADO-Net - a neural network for 3D LiDAR point cloud semantic segmentation. We incorporate a multi-view (bird-eye and range) projection feature extraction with an encoder-decoder ResNet architecture with a novel diamond context block. Current projection-based methods do not take into account that neighboring points usually belong to the same class. To better utilize this local neighbourhood information and reduce noisy predictions, we introduce a combination of Total Variation, Lovász-Softmax, and Weighted Cross-Entropy losses. We also take advantage of the fact that the LiDAR data encompasses 360◦field of view and use circular padding. We demonstrate state-of-the-art results on the SemanticKITTI dataset and also provide thorough quantitative evaluations and ablation results.
Martin Gerdzhev, Ryan Razani, Ehsan Taghavi
ICRA3
2021 Lite-HDSeg: LiDAR Semantic Segmentation Using Lite Harmonic Dense Convolutions
abstract
Autonomous driving vehicles and robotic systems rely on accurate perception of their surroundings. Scene understanding is one of the crucial components of perception modules. Among all available sensors, LiDARs are one of the essential sensing modalities of autonomous driving systems due to their active sensing nature with high resolution of sensor readings. Accurate and fast semantic segmentation methods are needed to fully utilize LiDAR sensors for scene understanding. In this paper, we present Lite-HDSeg, a novel real-time convolutional neural network for semantic segmentation of full 3D LiDAR point clouds. Lite-HDSeg can achieve the best accuracy vs. computational complexity trade-off in SemanticKITTI bench-mark and is designed on the basis of a new encoder-decoder architecture with light-weight harmonic dense convolutions as its core. Moreover, we introduce ICM, an improved global contextual module to capture multi-scale contextual features, and MCSPN, a multi-class Spatial Propagation Network to further refine the semantic boundaries. Our experimental results show that the proposed method outperforms state-of- the-art semantic segmentation approaches which can run real-time, thus is suitable for robotic and autonomous driving applications.
Ryan Razani, Ehsan Taghavi
ICRA3
2020 Adaptive Hierarchical Down-Sampling for Point Cloud Classification
abstract
Deterministic down-sampling of an unordered point cloud in a deep neural network has not been rigorously studied so far. Existing methods down-sample the points regardless of their importance for the network output and often address down-sampling the raw point cloud before processing. As a result, some important points in the point cloud may be removed, while less valuable points may be passed to next layers. In contrast, the proposed adaptive down-sampling method samples the points by taking into account the importance of each point, which varies according to application, task and training data. In this paper, we propose a novel deterministic, adaptive, permutation-invariant down-sampling layer, called Critical Points Layer (CPL), which learns to reduce the number of points in an unordered point cloud while retaining the important (critical) ones. Unlike most graph-based point cloud down-sampling methods that use k-NN to find the neighboring points, CPL is a global down-sampling method, rendering it computationally very efficient. The proposed layer can be used along with a graph-based point cloud convolution layer to form a convolutional neural network, dubbed CP-Net in this paper. We introduce a CP-Net for 3D object classification that achieves high accuracy for the ModelNet 40 dataset among point cloud-based methods, which validates the effectiveness of the CPL.
Ehsan Nezhadarya, Ehsan Taghavi, Ryan Razani
CVPR2
2016 Object recognition and identification using ESM data
Ehsan Taghavi, Dan Song 0005, Ratnasingham Tharmarasa, Thia Kirubarajan, Anne-Claire Boury-Brisset, Bhashyam Balaji
FUSION1
2015 Fusing social network data with hard data
T. Abirami, Ehsan Taghavi, Ratnasingham Tharmarasa, Thia Kirubarajan, Anne-Claire Boury-Brisset
FUSION2
2013 Bias estimation for practical distributed multiradar-multitarget tracking systems
Ehsan Taghavi, Ratnasingham Tharmarasa, Thia Kirubarajan, Yaakov Bar-Shalom
FUSION1
2013 Adaptive stopping for fast particle smoothing
abstract
Particle smoothing is useful for offline state inference and parameter learning in nonlinear/non-Gaussian state-space models. However, many particle smoothers, such as the popular forward filter/backward simulator (FFBS), are plagued by a quadratic computational complexity in the number of particles. One approach to tackle this issue is to use rejection-sampling-based FFBS (RS-FFBS), which asymptotically reaches linear complexity. In practice, however, the constants can be quite large and the actual gain in computational time limited. In this contribution, we develop a hybrid method, governed by an adaptive stopping rule, in order to exploit the benefits, but avoid the drawbacks, of RS-FFBS. The resulting particle smoother is shown in a simulation study to be considerably more computationally efficient than both FFBS and RS-FFBS.
Ehsan Taghavi, Fredrik Lindsten, Lennart Svensson, Thomas B. Schön
ICASSP1