arXiv subjects

Binbin Liu

Publications and source records attributed to Binbin Liu.

22 records · Page 2Linked to original sources

arXiv2021

PointCutMix: Regularization Strategy for Point Cloud Classification

As 3D point cloud analysis has received increasing attention, the insufficient scale of point cloud datasets and the weak generalization ability of networks become prominent. In this paper, we propose a simple and effective augmentation method for the point cloud data, named PointCutMix, to alleviate those problems. It finds the optimal assignment between two point clouds and generates new training data by replacing the points in one sample with their optimal assigned pairs. Two replacement strategies are proposed to adapt to the accuracy or robustness requirement for different tasks, one of which is to randomly select all replacing points while the other one is to select k nearest neighbors of a single random point. Both strategies consistently and significantly improve the performance of various models on point cloud classification problems. By introducing the saliency maps to guide the selection of replacing points, the performance further improves. Moreover, PointCutMix is validated to enhance the model robustness against the point attack. It is worth noting that when using as a defense method, our method outperforms the state-of-the-art defense algorithms. The code is available at:https://github.com/cuge1995/PointCutMix

cs.CV↗

arXiv2019

Online Newton Step Algorithm with Estimated Gradient

Online learning with limited information feedback (bandit) tries to solve the problem where an online learner receives partial feedback information from the environment in the course of learning. Under this setting, Flaxman et al.[8] extended Zinkevich's classical Online Gradient Descent (OGD) algorithm [29] by proposing the Online Gradient Descent with Expected Gradient (OGDEG) algorithm. Specifically, it uses a simple trick to approximate the gradient of the loss function $f_t$ by evaluating it at a single point and bounds the expected regret as $\mathcal{O}(T^{5/6})$ [8], where the number of rounds is $T$. Meanwhile, past research efforts have shown that compared with the first-order algorithms, second-order online learning algorithms such as Online Newton Step (ONS) [11] can significantly accelerate the convergence rate of traditional online learning algorithms. Motivated by this, this paper aims to exploit the second-order information to speed up the convergence of the OGDEG algorithm. In particular, we extend the ONS algorithm with the trick of expected gradient and develop a novel second-order online learning algorithm, i.e., Online Newton Step with Expected Gradient (ONSEG). Theoretically, we show that the proposed ONSEG algorithm significantly reduces the expected regret of OGDEG algorithm from $\mathcal{O}(T^{5/6})$ to $\mathcal{O}(T^{2/3})$ in the bandit feedback scenario. Empirically, we further demonstrate the advantages of the proposed algorithm on multiple real-world datasets.

cs.LG↗

arXiv2019

Realize special instructions on clustering VLIW DSP: multiplication-accumulation instruction

BWDSP is a 32bit static scalar digital signal processor with VLIW and SIMD features, which is designed for high-performance computing. Associated special instructions are designed for its special architecture and application scenarios. However, the existing compilation framework doesn't meet these special instructions. Therefore, in the context of traditional Open64 compiler, proposed a special instruction algorithm. Through this algorithm implements the multiplication-accumulation operation with BWDSP structure, to improve the performance of algorithms with multiply-accumulate requirements. Experimental results show that the algorithm, which can make an maximum of 8.85 speedup on BWDSP.

cs.OH↗

arXiv2018

Accurate evaluation of the fractal dimension based on a single morphological image

Fractal dimension (D) is an effective parameter to represent the irregularity and fragmental property of a self-affine surface, which is common in physical vapor deposited thin films. D could be evaluated through the scaling performance of surface roughness by using atomic force microscopy (AFM) measurements, but lots of AFM images with different scales (L) are needed. In this study, a surface roughness prediction (SRP) method was proposed to evaluate D values of a single AFM image, in which the roughness at smaller L was estimated by image segmentation with flatten modification. Firstly, a series of artificial fractal surfaces with ideal dimension (Di) values ranging from 2.1 to 2.9 were generated through Weierstrass-Mandelbrot (W-M) function, in order to compare SRP method with traditional methods such as box counting method and power spectral density method. The calculated dimension (Dc) by SRP method was much closer to Di than the other methods, with a mean relative error of only 0.64%. Secondly, SRP method was utilized to deal with real surfaces, which were AFM images of amorphous alumina thin films with L of 1-70 μm. Dc obtained by SRP method based on a single AFM image was also close to the result in our previous study by multi-image analysis at L above 10 μm, while the larger Dc at smaller L was consisted with the actual surface feature. The validity of SRP method and the physics nature of real surfaces were discussed, which might be helpful to obtain more understandings of fractal geometry.

cond-mat.mtrl-sci↗