Search arXiv⌕ Search

arXiv subjects

Xiaomeng Zhu

Publications and source records attributed to Xiaomeng Zhu.

22 records · Page 2Linked to original sources

Towards Sim-to-Real Industrial Parts Classification with Synthetic Dataset

This paper is about effectively utilizing synthetic data for training deep neural networks for industrial parts classification, in particular, by taking into account the domain gap against real-world images. To this end, we introduce a synthetic dataset that may serve as a preliminary testbed for the Sim-to-Real challenge; it contains 17 objects of six industrial use cases, including isolated and assembled parts. A few subsets of objects exhibit large similarities in shape and albedo for reflecting challenging cases of industrial parts. All the sample images come with and without random backgrounds and post-processing for evaluating the importance of domain randomization. We call it Synthetic Industrial Parts dataset (SIP-17). We study the usefulness of SIP-17 through benchmarking the performance of five state-of-the-art deep network models, supervised and self-supervised, trained only on the synthetic data while testing them on real data. By analyzing the results, we deduce some insights on the feasibility and challenges of using synthetic data for industrial parts classification and for further developing larger-scale synthetic datasets. Our dataset and code are publicly available.

cs.CV↗

Commutators of the maximal and sharp functions with weighted Lipschitz functions

Let $M$ be the Hardy-Littlewood maximal function. Denote by $M_b$ and $[b,M]$ the maximal and the nonlinear commutators of $M$ with a function $b$. The boundedness of $M_b$ and $[b,M]$ on weighted Lebesgue spaces are characterized when the symbols $b$ belong to weighted Lipschitz (weighted Morrey-Campanato) spaces. Some new characterizations for weighted Lipschitz spaces are obtained. Similar results are also established for the nonlinear commutator of the sharp function.

math.CA↗

New quaternary codes derived from posets of the disjoint union of two chains

Based on the generic construction of linear codes, we construct linear codes over the ring $\Bbb Z_4$ via posets of the disjoint union of two chains. We determine the Lee weight distributions of the quaternary codes. Moreover, we obtain some new linear quaternary codes and good binary codes by using the Gray map.

cs.IT↗

Optimal few-weight codes from simplicial complexes

Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\Bbb F_2+u\Bbb F_2$ by employing simplicial complexes. When the simplicial complexes are all generated by a maximal element, we determine the Lee weight distributions of two classes of the codes over $\Bbb F_2+u\Bbb F_2$. Our results show that the codes have few Lee weights. Via the Gray map, we obtain an infinite family of binary codes meeting the Griesmer bound and a class of binary distance optimal codes.

cs.IT↗