A
Alireza Sadri
Researcher at RMIT University
Publications - 6
Citations - 180
Alireza Sadri is an academic researcher from RMIT University. The author has contributed to research in topics: Cluster analysis & Greedy algorithm. The author has an hindex of 5, co-authored 6 publications receiving 112 citations.
Papers
More filters
Journal ArticleDOI
Clustering with Hypergraphs: The Case for Large Hyperedges
TL;DR: It is shown that large hyperedges are better from both a theoretical and an empirical standpoint, and a novel guided sampling strategy is proposed, based on the concept of random cluster models, that can generate large pure hyperedge size that significantly improve grouping accuracy without exponential increases in sampling costs.
Journal ArticleDOI
Industry 4.0: Development of a multi-agent system for dynamic value stream mapping in SMEs
TL;DR: A multi-agent system composed of several cost effective embedded Arduino systems as agents and a Raspberry-Pi® as a core agent that can reflect the non-linear material value flow without modelling the process or using RFID tags for dynamic value stream mapping (DVSM).
Journal ArticleDOI
Efficient Robust Model Fitting for Multistructure Data Using Global Greedy Search
TL;DR: A new robust model fitting method is proposed to efficiently segment multistructure data even when they are heavily contaminated by outliers and mutual information theory is applied to fuse the model hypotheses of the same model instance.
Journal ArticleDOI
Effective Sampling: Fast Segmentation Using Robust Geometric Model Fitting
TL;DR: In this paper, the authors proposed an effective sampling method to obtain a highly accurate approximation of the full graph required to solve multi-structural model fitting problems in computer vision, which is based on the observation that the usefulness of a graph for segmentation improves as the distribution of hypotheses (used to build the graph) approaches the distribution for the given data.
Journal ArticleDOI
Effective Sampling: Fast Segmentation Using Robust Geometric Model Fitting
TL;DR: In this paper, the authors proposed an effective sampling method for obtaining a highly accurate approximation of the full graph, which is required to solve multi-structural model fitting problems in computer vision.