Origin of the Solar Rotation Harmonics Seen in the EUV and UV Irradiance

Long-term periodicities in the solar irradiance are often observed with periods proportional to the solar rotational period of 27 days. These periods are linked either to some internal mechanism in the Sun or said to be higher harmonics of the rotation without further discussion of their origin. In this article, the origin of the peaks in periodicities seen in the solar extreme ultraviolet (EUV) and ultraviolet (UV) irradiance around the 7, 9, and 14 days periods is discussed. Maps of the active regions and coronal holes are produced from six images per day using the Spatial Possibilistic Clustering Algorithm (SPoCA), a segmentation algorithm. Spectral irradiance at coronal, transition-region/chromospheric, and photospheric levels are extracted for each feature as well as for the full disk by applying the maps to full-disk images (at 19.3, 30.4, and 170 nm sampling in the corona/hot flare plasma, the chromosphere/transition region, and the photosphere, respectively) from the Atmospheric Imaging Assembly (AIA) on board the Solar Dynamics Observatory (SDO) from January 2011 to December 2018. The peaks in periodicities at 7, 9, and 14 days as well as the solar rotation around 27 days can be seen in almost all of the solar irradiance time series. The segmentation also provided time series of the active regions and coronal holes visible area (i.e. in the area observed in the AIA images, not corrected for the line-of-sight effect with respect to the solar surface), which also show similar peaks in periodicities, indicating that the periodicities are due to the change in area of the features on the solar disk rather than to their absolute irradiance. A simple model was created to reproduce the power spectral density of the area covered by active regions also showing the same peaks in periodicities. Segmentation of solar images allows us to determine that the peaks in periodicities seen in solar EUV/UV irradiance from a few days to a month are due to the change in area of the solar features, in particular, active regions, as they are the main contributors to the total full-disk irradiance variability. The higher harmonics of the solar rotation are caused by the clipping of the area signal as the regions rotate behind the solar limb.

A new stochastic gradient descent possibilistic clustering algorithm

Several well known clustering algorithms have their own online counterparts, in order to deal effectively with the big data issue, as well as with the case where the data become available in a streaming fashion. However, very few of them follow the stochastic gradient descent philosophy, despite the fact that the latter enjoys certain practical advantages (such as the possibility of (a) running faster than their batch processing counterparts and (b) escaping from local minima of the associated cost function), while, in addition, strong theoretical convergence results have been established for it. In this paper a novel stochastic gradient descent possibilistic clustering algorithm, called O- PCM 2 is introduced. The algorithm is presented in detail and it is rigorously proved that the gradient of the associated cost function tends to zero in the L 2 sense, based on general convergence results established for the family of the stochastic gradient descent algorithms. Furthermore, an additional discussion is provided on the nature of the points where the algorithm may converge. Finally, the performance of the proposed algorithm is tested against other related algorithms, on the basis of both synthetic and real data sets.

Segmentation of Coronal Features to Understand the Solar EUV and UV Irradiance Variability III. Inclusion and Analysis of Bright Points

The study of solar irradiance variability is of great importance in heliophysics, Earth’s climate, and space weather applications. These studies require careful identifying, tracking and monitoring of features in the solar photosphere, chromosphere, and corona. Do coronal bright points contribute to the solar irradiance or its variability as input to the Earth atmosphere? We studied the variability of solar irradiance for a period of 10 years (May 2010 – June 2020) using the Large Yield Radiometer (LYRA), the Sun Watcher using APS and image Processing (SWAP) on board PROBA2, and the Atmospheric Imaging Assembly (AIA), and applied a linear model between the segmented features identified in the EUV images and the solar irradiance measured by LYRA. Based on EUV images from AIA, a spatial possibilistic clustering algorithm (SPoCA) is applied to identify coronal holes (CHs), and a morphological feature detection algorithm is applied to identify active regions (ARs), coronal bright points (BPs), and the quiet Sun (QS). The resulting segmentation maps were then applied on SWAP images, images of all AIA wavelengths, and parameters such as the intensity, fractional area, and contribution of ARs/CHs/BPs/QS features were computed and compared with LYRA irradiance measurements as a proxy for ultraviolet irradiation incident to the Earth atmosphere. We modeled the relation between the solar disk features (ARs, CHs, BPs, and QS) applied to EUV images against the solar irradiance as measured by LYRA and the F10.7 radio flux. A straightforward linear model was used and corresponding coefficients computed using a Bayesian method, indicating a strong influence of active regions to the EUV irradiance as measured at Earth’s atmosphere. It is concluded that the long- and short-term fluctuations of the active regions drive the EUV signal as measured at Earth’s atmosphere. A significant contribution from the bright points to the LYRA irradiance could not be found.

Possibilistic Clustering-Promoting Semi-Supervised Learning for EEG-Based Emotion Recognition

The purpose of the latest brain computer interface is to perform accurate emotion recognition through the customization of their recognizers to each subject. In the field of machine learning, graph-based semi-supervised learning (GSSL) has attracted more and more attention due to its intuitive and good learning performance for emotion recognition. However, the existing GSSL methods are sensitive or not robust enough to noise or outlier electroencephalogram (EEG)-based data since each individual subject may present noise or outlier EEG patterns in the same scenario. To address the problem, in this paper, we invent a Possibilistic Clustering-Promoting semi-supervised learning method for EEG-based Emotion Recognition. Specifically, it constrains each instance to have the same label membership value with its local weighted mean to improve the reliability of the recognition method. In addition, a regularization term about fuzzy entropy is introduced into the objective function, and the generalization ability of membership function is enhanced by increasing the amount of sample discrimination information, which improves the robustness of the method to noise and the outlier. A large number of experimental results on the three real datasets (i.e., DEAP, SEED, and SEED-IV) show that the proposed method improves the reliability and robustness of the EEG-based emotion recognition.

Dealing With Noise and Partial Volume Effects in Alzheimer Disease Brain Tissue Classification by a Fuzzy-Possibilistic Modeling Based on Fuzzy-Genetic Initialization

Segmentation is a key step in brain imaging where clustering techniques are widely used, particularly the fuzzy approach which offers active and robust methods against noise and partial volume effect (PVE). To address those imperfections, this article suggests an automatic segmentation of brain tissues for magnetic resonance and functional images of Alzheimer's patients, based on an efficient and robust genetic-fuzzy-possibilistic clustering scheme for the assessment of white matter, gray matter and cerebrospinal fluid volumes. The proposed hybrid clustering process based on: 1) A fuzzy possibilistic c-means algorithm that models the degree of relationship between each voxel and a given tissue. 2) A fuzzy c-means algorithm to initialize the clusters centers, with subsequent optimization by a genetic algorithm. Each stage of the proposed clustering process is validated on real brain data and synthetic images of an Alzheimer's Disease Neuroimaging Initiative (ADNI) phantom. A performance comparison is made with the usual fuzzy techniques. The visual and quantitative results obtained with the proposed approach using various signal-to-noise ratios prove its effectiveness to quantify the tissue volume of images of different modalities types in the presence of noise and PVE. The effectiveness in terms of computational rate is also demonstrated.

Brain Magnetic Resonance Imaging Segmentation Using Possibilistic Clustering Algorithm Combined with Context Constraints

Because the FCM method is simple and effective, a series of research results based on this method are widely used in medical image segmentation. Compared with the traditional FCM, the probability clustering (PCM) algorithm cancels the constraint on the normalization of each sample membership degree in the iterative process, and the clustering effect of the method is improved within a certain range. However, the above two methods only use the gray value of the image pixels in the iterative process, ignoring the context constraint relationship between the high-dimensional image pixels. The two are easily affected by image noise during the segmentation process, resulting in poor robustness, which will affect the segmentation accuracy in practical applications. In order to alleviate this problem, this paper introduces the context constraint information of image based on PCM, and proposes a PCM algorithm that combines context constraints (CCPCM) and successfully applies it to human brain MR image segmentation to further improve the noise immunity of the new algorithm. Expand the applicability of new algorithms in the medical field. Through simulation results on medical images, it is found that compared with the previous classical clustering methods, such as FCM, PCM, etc., the CCPCM has better anti-interference to different noises, and the segmentation boundary is clearer. At the same time, CCPCM algorithm introduces the spatial neighbor information adaptive weighting mechanism in the clustering process, which can adaptively adjust the constraint weight of spatial information and optimize the clustering process, thus improving the segmentation efficiency.