arXiv subjects

Mingming Meng

Publications and source records attributed to Mingming Meng.

2 recordsLinked to original sources

arXiv2022

Analysis of the distribution, rotation and scale characteristics of solar wind switchbacks: comparison between the first and second encounters of Parker Solar Probe

The S-shaped magnetic structure in the solar wind formed by the twisting of magnetic field lines is called a switchback, whose main characteristics are the reversal of the magnetic field and the significant increase in the solar wind radial velocity. We identify 242 switchbacks during the first two encounters of Parker Solar Probe (PSP). Statistics methods are applied to analyze the distribution and the rotation angle and direction of the magnetic field rotation of the switchbacks. The diameter of switchbacks is estimated with a minimum variance analysis (MVA) method based on the assumption of a cylindrical magnetic tube. We also make a comparison between switchbacks from inside and the boundary of coronal holes. The main conclusions are as follows: (1) the rotation angles of switchbacks observed during the first encounter seem larger than those of the switchbacks observed during the second encounter in general; (2) the tangential component of the velocity inside the switchbacks tends to be more positive (westward) than in the ambient solar wind; (3) switchbacks are more likely to rotate clockwise than anticlockwise, and the number of switchbacks with clockwise rotation is 1.48 and 2.65 times of those with anticlockwise rotation during the first and second encounters, respectively; (4) the diameter of switchbacks is about 10^5 km on average and across five orders of magnitude (10^3 -- 10^7 km).

astro-ph.SR↗

arXiv2021

Self-Paced Deep Regression Forests with Consideration of Ranking Fairness

Deep discriminative models (DDMs), e.g. deep regression forests and deep decision forests, have been extensively studied recently to solve problems such as facial age estimation, head pose estimation, etc.. Due to a shortage of well-labeled data that does not have noise and imbalanced distribution problems, learning DDMs is always challenging. Existing methods usually tackle these challenges through learning more discriminative features or re-weighting samples. We argue that learning DDMs gradually, from easy to hard, is more reasonable, for two reasons. First, this is more consistent with the cognitive process of human beings. Second, noisy as well as underrepresented examples can be distinguished by virtue of previously learned knowledge. Thus, we resort to a gradual learning strategy -- self-paced learning (SPL). Then, a natural question arises: can SPL lead DDMs to achieve more robust and less biased solutions? To answer this question, this paper proposes a new SPL method: easy and underrepresented examples first, for learning DDMs. This tackles the fundamental ranking and selection problem in SPL from a new perspective: fairness. Our idea is fundamental and can be easily combined with a variety of DDMs. Extensive experimental results on three computer vision tasks, i.e., facial age estimation, head pose estimation, and gaze estimation, show our new method gains considerable performance improvement in both accuracy and fairness. Source code is available at https://github.com/learninginvision/SPU.

cs.CV↗