extfieldsofstudy: Business Physics

text:
The developing program system of social monitoring of road improvement and urban infrastructure

In the study, there is considering a problem of monitoring and evaluating the operational status of road network. As the main task, there was highlighted the creating a unified informational center providing a possibility of fixing defects in roadway and poor-quality infrastructure and providing an early warning responsible authorities. The suggested informational system let distribute tasks between contractors and track the work efficiency. To solve the task, there was developed a mobile application for data capture by users and web-service for specialists of responsible authorities united to the “IS MRIB” single information center. In the study, there were describing requirements to the system and using software for implementation. There were use-diagram and interface layouts. To justify the advisability of the system development it was a comparing analysis of analogues and distinguishing advantages of the proposed way. Ways of popularizing mobile application were suggested to increase volume of collecting information.

Introduction
Nowadays, in Russian cities there are many problems of beautification [1]. It includes poor-quality improvement of municipal facilities work, which affects the general appearance of cities. Wastelands and poor street lighting make a basis for increasing crime rates [2]. But main problems are road surface defects. According to The Scientific Road Safety Center of the MIA of Russia, in 2018 in country there were 59.4 thousand accidents due to deficiencies of the operational status of the road network [3]. Many of these violations cannot be timely resolved because of the lack of awareness of responsible authorities' employees in concrete hotbed of problems.
Moreover, certain areas require a priority response and complex solution of beautification problems. The main task of informing responsible institutions is creating unified information center providing a possibility of fixing road defects and poor-quality infrastructure with the linking its location to a map and adding into unified database. With the application, responsible authorities' specialists can timely respond to handlings, see a full picture of detected problems and plan current repair and improvement work better. In addition, the information center allows quickly distributing tasks among contractors and track the efficiency of their work.

Solution description
The task result of the problem is creating a mobile application for the urban infrastructure inspection and a web application for displaying detected problems and providing feedback with responsible authorities united to "IS MRIB" unified information service. In the result of the implementation of the information application, there are the next changes: Thus, the developed system provides functionality, which is discussed below. For citizens:  Creating a violation card: possibility of choosing a type of a violation; possibility of making a photo of a detected violation in the application; possibility of downloading done photos from mobile storage; possibility of describing details and giving a comment of a violation in the textbox; possibility of specifying a location of a violation manually or automatically.  Countdown timer to a card if there is scheduled response time or fixing time (for example, a hole on a road must be fixed in no more than 3 working days).  Sending and confirming.  Assigning a status to a card.  Displaying violations in the map from all users.  Colour indication of violation markers in the map: green is the normative period expires in more than a day; yellow is the normative period expires in less than a day; red is the normative period expires today; grey is the normative period does not exist.   Use-case diagram of the suggested information system is presented on figure 1. On figure 2 there is an interface of several windows of the mobile application.

Results and discussion
In the current time, there are information systems with similar functional. There is comparing software products with the suggested solution in next points (table 2).   Who is the responsible person for the fixing identified problems?  What the regional coverage a software product has to have?  What is the purpose of the creating a software product?  What the platform a software product has to have?
According to table 2, summing up is that in the market most applications are resources of accountability and complaint. Moreover, there is no software products, in which an initiator of the creation is an organization, which is responsible for the fixing detected problems, it complicates feedback. The closest analogues are the "Our city" application, but it serves a current area and it is focused on its features and specifics.
The introduction of the "IS MRIB" informational application has to impact on the sphere of the road management and the urban improvement in several points.
Firstly, the mechanism can allow detecting poor-quality work of contractor before the expiration of warranty time, it will significantly save municipality resources [4]. Nowadays, all state and municipal customers have to set warranty time to road works [5]. Because of large volumes of done works, a customer is not able to check all parts personally or timely process complaints received from citizens in writing. According it, the big amount of poor-quality done works is detected after the expiration of the warranty time.
Secondly, the software can allow establishing feedback between the municipality and citizens. During the solution of detected problems, citizens are able to see a work of responsible authorities. Today there is no tool to show the implementation of their responsibilities by MRIB authorities, that makes a distrust from habitants.
An important problem of the implementation of the type of system is the incentive of citizens to find out problems of beautification. To the functional system, it is necessary to update database regularly. For it, the list of encouragements has been performed for active users in the system. The list envisages different material and non-material encouragements: a public transport privilege, free tickets to museums, invitations to exhibitions, fairs, etc. This way of material and non-material stimulate can allow increasing interest in a project and engage a big number of citizens to surrounding problems as well as it increases the quality of information in requests [6].

Conclusion
At the moment, the creating the suggested information application is in demand citizens and responsible authorities. The software product will allow improving the quality of citizen life. Methods of material and non-material stimulating members of the process of an operational road network status let increase an amount of involved people and, as a result, a volume and quality of gathered information. As quality, there are not only characteristics of receiving information but also the geographic coverage of detected violations. In the way, the increasing a number of involved citizens simplifies a collection of needed information for responsible authorities. The quick feedback directed to some operational fixing disadvantages of the road infrastructure is an important step in the way of the forming a clever city [7].


Optimizing Sparse RFI Prediction using Deep Learning

Radio Frequency Interference (RFI) is an ever-present limiting factor among radio telescopes even in the most remote observing locations. When looking to retain the maximum amount of sensitivity and reduce contamination for Epoch of Reionization studies, the identification and removal of RFI is especially important. In addition to improved RFI identification, we must also take into account computational efficiency of the RFI-Identification algorithm as radio interferometer arrays such as the Hydrogen Epoch of Reionization Array grow larger in number of receivers. To address this, we present a Deep Fully Convolutional Neural Network (DFCN) that is comprehensive in its use of interferometric data, where both amplitude and phase information are used jointly for identifying RFI. We train the network using simulated HERA visibilities containing mock RFI, yielding a known"ground truth"dataset for evaluating the accuracy of various RFI algorithms. Evaluation of the DFCN model is performed on observations from the 67 dish build-out, HERA-67, and achieves a data throughput of 1.6$\times 10^{5}$ HERA time-ordered 1024 channeled visibilities per hour per GPU. We determine that relative to an amplitude only network including visibility phase adds important adjacent time-frequency context which increases discrimination between RFI and Non-RFI. The inclusion of phase when predicting achieves a Recall of 0.81, Precision of 0.58, and $F_{2}$ score of 0.75 as applied to our HERA-67 observations.

INTRODUCTION
Next generation radio interferometers are now beginning to become operational. These arrays are looking to detect and measure some of the weakest signals the Universe has to offer, such as the brightness-temperature contrast of the E-mail: joshua kerrigan@brown.edu (JRK) 21cm signal during the Epoch of Reionization (EoR). By measuring this highly redshifted signal we can characterize the progression of the EoR. The understanding gained from this characterization has the potential to help us unravel how the first stars and galaxies formed and reionized their surrounding neutral hydrogen. While instruments like the Hydrogen Epoch of Reionization Array (HERA) (De-Boer et al. 2017) have the intrinsic sensitivity required to detect the EoR signal through a power spectrum, they are afflicted with anthropogenic noise which we refer to as Radio Frequency Interference (RFI). Interference from RFI in 21cm EoR observations is an especially significant obstacle because it can have a brightness anywhere from on the order of the EoR signal to orders of magnitude beyond even Galactic and extra-galactic foregrounds. RFI unfortunately introduces a reduction in sensitivity in two separate but distinct ways, one being the direct contamination by having similar spectral characteristics and overpowering of the 21cm signal, and the other being the introduction of a complex sampling function due to missing data. This produces correlations between modes when computing the Fourier transform along the frequency axis (Offringa et al. 2019). It is therefore important to strike a balance between identifying RFI while not falsely identifying non-RFI as RFI, which leads to further complicating our sampling function over frequency. Many approaches have recently been developed to identify and extract RFI from radio telescope data. RFI algorithms of particular interest include AOflagger (Offringa et al. 2012), which uses a Scale-invariant Rank operator to identify morphologies that are scale-invariant in time or frequency which is a characteristic of many RFI signals. This RFI detection strategy has been used successfully on instruments such as the MWA (Offringa et al. 2015) and the Low-Frequency Array (LOFAR) (Offringa et al. 2013). Alternative approaches to RFI identification include the application of neural networks. More specifically, a Deep Fully Convolutional Neural Network (DFCN) based on the U-Net architecture (Ronneberger et al. 2015) has been used on single dish radio telescope data (Akeret et al. 2017), and a Recurrent Neural Network (RNN) has been applied to signal amplitudes from radio interferometer data (Burd et al. 2018).
In this paper we expand upon the RFI identification approach using a DFCN developed in Tensorflow (Abadi et al. 2016) with the use of both the amplitude and phase information from an interferometric visibility. This technique is prompted by examples such as what is shown in Figure 1, which demonstrates how the phase of time-ordered visibilities (waterfall visibilities) can provide supplemental information in identifying RFI beyond that of an amplitude-only approach. Note that in this paper, all time-ordered visibility plots of real data are in the yellow-purple palette (e.g. Figure 1) whereas all simulated data is in the blue-white palette (e.g. Figure 7). To understand the improvements afforded by our joint amplitude-phase network we compare it to both an amplitude only network and the Watershed RFI algorithm (See Appendix A) which is the current RFI-flagging algorithm of choice for the HERA data processing pipeline.
The paper is outlined as follows. Section 2 introduces the architecture of our network, discusses how it compares to previous work, and describes the training dataset. We then demonstrate the effectiveness by evaluating both DFCNs on simulated and real HERA observations in Section 3. Finally in Section 4 we conclude with discussion of further applications and future work.   ), but it differs to an ANN's dense layers of 'neurons' by its successive convolutions of an input image, which preserves spatial dependence. Each convolutional layer contains a set of learnable filters which represent a response for particular shapes at different scales (e.g. the edges of an object in an image). The convolved output for every layer is then typically downsampled using a process known as max pooling that strides a window across the image keeping the highest pixel value within the window. Max pooling provides both a computational improvement due to a decreased image size, and an added level of abstraction relative to the initial image. After the convolution and max pooling layers the image typically is then passed through a non-linear activation function (e.g. sigmoid function) which produces a spatial activation map describing the convolutional layer's response to every pixel contained within the image. The eventual output of these successive convolution, max pooling, and activation layers is then used to predict (or regress) based on the classification of the image. The error between the predicted class and the true class is then computed through a loss function such as the cross-entropy loss (or mean squared error for regression) and the error is back-propagated through the network updating the learn-able parameters.
The style of network we describe in this paper deviates from a traditional CNN by requiring a fully connected convolutional layer of neurons after the convolutional downsampling and an upsampling stage to semantically predict classes on a per-pixel basis. For a deeper understanding of this kind of network architecture, see Krizhevsky et al. (2017). We begin with a Deep Fully Convolutional Network architecture similar to the U-Net RFI (Ronneberger et al. 2015;Akeret et al. 2017) implementation. However, instead of using a uniform number of feature layers for each convolutional layer, we use an image pyramid (Lin et al. 2016) style approach with an increasing number of features as the network approaches the fully connected convolutional layers and invert to a decreasing number of feature layers towards the output prediction layer. This approach should offer us an increase in performance as the input image for each successive convolution shrinks. Each stacked layer in the max pooling stages has the dimensions of ( H 2 L × W 2 L × 2 L F) where F is the number of feature layers, H and W are the layer height and width in pixels, and L is the layer of interest.
To adapt the network to use the visibility phase component, we mirror the amplitude only network as shown in Figure 2. We then combine successive amplitude & phase convolution layers at each transpose convolution layer with the technique known as 'skip connections' introduced in Long et al. (2014) and He et al. (2016). This is implemented by taking the output of a downsampled convolutional layer and concatenating it with an upsampled transpose convolutional layer of equal time, frequency, and feature dimensions. By using these skips in the convolutional pathway, the network is provided with an initial "template" from which to make small deviations. This fixes an issue within deep networks where fits to higher-order nonlinearities become dominant in a layer, leading to training and overfitting issues. Empirically, we find that using skip connections in conjunction with phase information allows for training a deeper network that converges in fewer iterations than the simple amplitude-only network.
For each of the skip layer concatenations between the amplitude and phase pathways, we subtract the mean and normalize over both time and frequency, which assists in standardization as amplitude and phase features can be quite dissimilar. The amplitude only DFCN we use has ∼ 6×10 5 trainable parameters, while the addition of the phase downsampling layers for the amplitude & phase DFCN pushes the number of trainable parameters to ∼9×10 5 . The specific per layer attributes employed in our networks can be seen in Table 1, where it should be noted that per layer dimension sizes are not specified because this style of network is agnostic to the input height and width.
To optimize the network hyperparameters, a coarse grid search was performed over dropout rate, learning rate, and batch size; the optimal results from this search are found in Table 2. The depth of our convolutional layers are chosen to maximize learning and minimize prediction times, while trying to retain abstractions of the input visibilities that can properly describe our RFI. These dimensions are thus determined by initially training at an arbitrarily high number of feature layers and scaling back to the minimum number of layers we need to retain for convergence of the training loss.

Data Preparation
The analysis in this paper is performed entirely on HERA data (both simulated and real) and therefore should be noted that any data preparation techniques outlined here may be unique to HERA. This does not imply that they are unsuit- able for other radio interferometers but additional precautions may need to be taken into consideration. To prepare the amplitude-phase input space to be as robust to as many visibility scenarios as possible, we must adopt several standardizations. The amplitude of the visibility can vary drastically by local sidereal time (LST), day, and baseline type while having significant differences in dynamic range. In contrast, the phase of a visibility is intrinsically more standardized: it is constrained between −π ≤ φ ≤ π and should have a mean that is approximately µ φ = 0, so we should only expect substantial deviations across baseline type, which are due to changing fringe rates. Therefore to lessen the dynamic range issues in amplitude, we standardize our waterfall visibilities V(t, ν), according toV(t, ν) = (ln|V | − µ ln|V | )/σ ln|V | , by subtracting the mean, µ ln|V| , and dividing by the standard deviation, σ ln|V| , across time and frequency of the logarithmic visibilities.
To further increase the robustness and generalizability of our network for different time and frequency sub-bands, we slice the HERA visibilities into 16 spectral windows of dimensions 64 frequency channels by 60 time integrations (6.3 MHz×600 sec). We then pad both time and frequency dimensions by reflecting about the boundaries, extending the dataset in both directions. This allows for making predictions for the edge pixels, which otherwise would be ignored due to the size of our convolution layer kernel size of 3 × 3 (98.44 kHz × 30 s). Furthermore, we want to use square input channels to maintain a 1:1 aspect of time to frequency pix-  Maas et al. (2013) els. These considerations inform the decision to use a 68×68 input image.
Combined with our training batch size, N, of 256, for our amplitude-phase DFCN, this gives us an input training

Training Dataset
The training dataset was composed of simulated HERA visibilities using the simulator, hera sim. 1 .
This simulator creates visibilities according to a 'pseudo-sky', which means that modeled point sources have no relationship, in either time or frequency, to any real extragalactic source on the sky (e.g. Fornax A). Extragalactic point sources are modeled using the discrete form of the visibility equatioñ (1) (Parsons et al. 2012) which depends upon the source delay position on the sky, τ, the source spectrum, S n (ν), and the delay-dependent interferometer gains,Ã(τ,ŝ), where a tilde represents the Fourier transform converting between frequency ν and delay τ and * represents a convolution. Point source flux densities are drawn from a power-law distribu- The source delays (sky positions) are also chosen according to a uniform random distribution. Each simulated waterfall visibility contains between 10 3 ≤ N sr cs ≤ 10 4 sources with the aforementioned characteristics. We simulate diffuse galactic emissions with the de Oliveira-Costa et al. (2008) Global Sky Model (GSM) and an analytic form of the HERA primary beam (Parsons 2015). GSM diffuse emissions are not precisely modeled but created to give a sky-like realization by sampling across LST and frequency, and applying a filter in time that has a fringe-rate corresponding to the baseline type being simulated. The visibility baseline types are uniformly sampled across LST, where baseline length, | ì b|, is chosen according to a half-normal distribution with µ | ì b | = 7.5 λ and σ | ì b | = 150 λ. This is done to closely resemble the distribution of baseline lengths seen in HERA which 1 https://github.com/HERA-Team/hera_sim is weighted towards short baselines. The learned model can be further tuned as longer baseline types are introduced.
We model RFI with four distinct classes: narrowband persistent (e.g. ORBCOMM), narrowband burst (e.g. ground/air communications), broadband burst (e.g. lightning), and random single time-frequency 'blips'. Narrowband persistent constitutes the majority of RFI and are most often the brightest sources in HERA observations; these are empirically modeled. Narrowband bursts have no preference in duration or frequency but typically persist > 30 s and are simulated with a Gaussian profile in time to mimic the roll on/off seen in HERA observations. Broadband bursts are rare events that exist across the entire HERA band at specific time integrations. These events are introduced in only 3% of the training data. We randomly inject 'blips' that are RFI with a duration of ∆t ≤ 10 s and frequency width, ∆ν ≤ 100 kHz, which when taking into account HERA's time and frequency resolution places this class of RFI into single visibility pixels.
To create the most comprehensive HERA visibility simulations to mimic real observations we include simplistic models of several important effects seen in the HERA signal chain. These effects include: Cross-talk -An effect due to over-the-air coupling between nearby HERA receivers and dipole-arm coupling. This spurious correlation is mocked by convolving the simulated visibility with white noise.
HERA bandpass -Empirically derived from HERA bandpass measurements and fit to a 7 th order polynomial (Parsons & Beardsley 2017).
Gain fluctuations -Fluctuations are applied to the analytic HERA bandpass by introducing individual phase delays with a uniform spread between −20 ≤ δτ ≤ 20 ns.
We simulate a training dataset of 1000 HERA observations of 10 minutes (60 time integrations) over the frequency range of 100-200 MHz (1024 frequency channels). The mean RFI occupancy rate for these simulated observations was ∼ 10%. This value differs from the ∼3% which is the typically observed RFI environment in the Karoo Desert, South Africa seen in past HERA observations (Kohn 2016) which used a simple statistical thresholding RFI algorithm. The comparison between our simulated and more recent real HERA dataset RFI occupancy rates across the band can be seen in Figure 3. We further expand this training dataset by performing data augmentation techniques on the reduced spectral windows. These techniques include mirroring over time and frequency, Gaussian random noise injection (correlated between amplitude and phase) with an amplitude that is at most 10% of |V | the visibility amplitude and by translating a spectral window across the band creating unique window samples at varying frequency intervals. Using a translation in frequency has the intent of reducing over-fitting to steady state narrow-band RFI (e.g. ORBCOMM) because of repetitive sub-band samples entering the training dataset.
After increasing our simulated dataset volume through augmentation it is sliced into 16 spectral windows and padded according to Section 2.2 which results in 44800 unique spectral window visibilities each of size 68 time sam-    . The hera sim mock RFI (blue) occupancy rates across the band with its variance (blue region), as compared to RFI flagged in our real HERA data evaluation dataset (orange) with its own variance (orange region). The simulated RFI is overemphasized (> 10 %) in the training dataset. This is done in an attempt to balance the training due to RFI being a significantly sparse class which without would lead to more significance placed on Non-RFI when computing the loss.
ples × 68 frequency channels. We separate this simulated dataset by an 80-20 split, where 80% of the simulated dataset is used for training and 20% is used for validation.

EVALUATION
For the evaluation of our networks we used several datasets unseen in training. The real observed dataset used for evaluation consisted of HERA observing data from the 2017 -2018 season, more specifically between the Julian Dates of 2458098 -2458116, which we will just refer to as our real HERA dataset . The real HERA data were composed of raw uncalibrated visibilities that have been visually inspected and manually flagged by hand with high-and lowfrequency band edges removed. Hand flagging was accomplished by looking in both amplitude and phase for sharp discontinuities and structure that exhibited an increase in power when compared to a fringing sky signal. The band edge removal is a precaution due to the large dynamic range roll-off, which makes discriminating between RFI and sky observations nearly impossible for humans and algorithms alike. This reduces our actual data evaluation passband to 896 frequency channels which covers 106 ≤ ν ≤ 194 MHz.
A simple approach to evaluation would rely on using the accuracy of predictions meaning we only look at the number of correctly predicted RFI pixels relative to all RFI, although this metric hides important details to the performance of our networks. This is an important consideration in this instance because our HERA data observations contain on average 3% of data corrupted by RFI, which means a blanket classification of "No-RFI" would yield an accuracy rate of 97%. To account for this class imbalance we evaluate the effectiveness of our networks by using several metrics commonly employed for classification. We use the standard metrics of Recall and Precision, which are defined as where we consider True Positives (TP) to be correctly predicted RFI pixels, False Negatives (FN) are RFI pixels identified as No-RFI, and False Positives (FP) are No-RFI pixels incorrectly identified as RFI. We can therefore understand Recall as the fraction of all RFI events identified by the flagging algorithm, and Precision the fraction of identified RFI that is actually RFI. We also need a metric that is sensitive to a dataset with a sparse class, as in our case where RFI represents < 3% of our observations, and one that can condense our overall performance into a single metric. We therefore can use the binary classifier performance metric, the F-score which has the general form of where we set β = 2 to preferentially weight Recall 2 The F 2 score therefore provides us with a metric that has an aggressive stance towards RFI while still being somewhat sensitive to false positive flagging. Due to the nature of measuring the 21cm EoR signal with HERA where we have collected sufficient data to not be noise limited, we can sacrifice good quality observations for the sake of reducing as much RFI contamination as possible; thus allowing for a higher rate of FPs. This leads us to maximizing Recall while allowing Precision to suffer which is preferential when averaging over many nights of observations and we want to minimize contamination.
We compare three distinct algorithms: the amplitudeonly DFCN, amplitude-phase DFCN, and the Watershed RFI algorithm. For a fair comparison we evaluate the DFCNs after both have converged independently of the number of training epochs, ensuring that they have learned the training dataset to their maximum capability. The networks are then checked for over-fitting by comparing that the evaluation loss is similar to that of each networks training loss when applied to the unseen 30% of simulated visibilities set aside for evaluation.
The results of each algorithm along with their performance metrics are reported in Table 3 as applied to simulated datasets. These metrics are performed on data that are unique from the previous training/evaluation datasets and include a control dataset which has no RFI present and four others that contain a single distinct class of RFI. An example of what each RFI class is modeled after is shown in Figure 4. In doing this, we can gauge how sensitive each algorithm is to a certain class of RFI. The DFCN networks both perform well on the narrowband time persistent and burst RFI which is unsurprising as these simulations closely resemble the evaluation dataset and only differ in occurrence of events. However, both networks are inadequate for identifying Broadband Bursts and 'blips'. This is understandable from a training perspective as both of these classes of RFI are going to be the last to be modeled in our networks as they account for only a minor fraction of all simulated RFI and lead to little overall optimization of the loss. This could potentially be remedied by placing more emphasis on these two classes of RFI in the training dataset or a much more in depth hyperparameter optimization of per-layer kernel sizes.
Before we approach the evaluation on our HERA data data we further optimize how our networks handle the shift in domain from simulation to observed. This is done by looking at the Receiver Operating Characteristics (ROC) curves in Figure 5 of both the networks and the Watershed algorithm. The ROC curve gives us an idea of the performance of our network by looking at how the True and False Positive rates respond to different thresholding values of the networks' softmax output layer.
We determine the optimal thresholding value by using the maximum F 2 score across all thresholds which is shown to find a reasonable balance by locating the 'knee' of the ROC curve. We then compare all three algorithms as applied to a simulated hera sim and real HERA dataset in Table 4. Looking at the prediction rates, both DFCN networks display an immense improvement over the Watershed RFI algorithm, boasting rates of 32× and 22× better than the Watershed, for the amplitude and amplitude-phase networks respectively. The faster amplitude only prediction rate compared to the amplitude-phase is unsurprising, as the number of parameters involved in an amplitude-phase prediction is roughly 1.5× more and scales approximately proportional with the prediction rate. An example of these results, which serves to give an appropriate idea of the average performance as applied to a real HERA waterfall visibility is shown in Figure 6; how each compares on simulated data can be seen in Figure 7. Both DFCN networks have a tendency to overpredict RFI where there may not be any, however in the case of the narrowband RFI seen in frequency channels 175 MHz and 189 MHz, it may not be unreasonable to be more aggressive as leakage into adjacent channels can occur. This can be difficult to quantify of course as the ground truth of our real HERA data is unknown and RFI leakage can be easily masked by the sky.

CONCLUSIONS
Machine learning applications in the fields of astronomy and cosmology are rapidly developing, and in many cases are beginning to outmaneuver the classical algorithms by way of increased speed and more accurate predictions. In this paper we described an RFI identification approach to using a Deep Fully Convolutional Neural Network, which combined the amplitude and phase of an interferometer's measured visibility to predict which time-frequency pixels contained RFI. We compared this result to the Watershed RFI algorithm in the HERA data processing pipeline, and demonstrated that the DFCN approach was vastly more time efficient in its prediction with comparable to improved RFI identification rates. We also show that by including the phase component of the visibility we can mitigate the effects of domain shift between an entirely simulated HERA visibility training dataset and the observed validation dataset. This means that by improving our simulated model for HERA visibil- Table 3. RFI recovery metrics based on individual type of simulated RFI. We look at the Recall, Precision, and F 2 score for each of the three algorithms as simulated with hera sim. The Recall and Precision rates are the average over 1000 simulated waterfall visibilities with the same simulation parameters for foregrounds and signal chain outlined in Section 2.3. Values in bold indicate the best achieved rate within each RFI type across algorithms.  Figure 4. Examples of the four RFI classes from HERA data as they appear in amplitude and phase that we model in our simulations. Note the different time and frequency scales on each plot. The narrowband example (row 1) centered at a frequency of ∼ 137.2 MHz is the ORBCOMM satellite system which is occasionally intermittent. Narrowband burst (row 2) is typically limited across only a few frequency channels (≤ 500 kHz) and has no consistent operating pattern over time. Broadband burst events (row 3) are short time duration (≤ 40 s) and can exist across the entire band (e.g. lightning) or in a sub-band as seen here flanked by the South African Broadcasting Corporation's channel 4 video (175.15 MHz) and audio (181.15 MHz) broadcasts (Kohn 2016). The 'blips' (row 4) demonstrate the one off nature of this sparse class as compared to the intermittent transmitter at frequency 125 MHz. Table 4. RFI recovery metrics for hera sim simulated data containing signal chain effects with all classes of RFI and raw (uncalibrated) HERA observations from the 2017 -2018 observing season. All results in the real HERA data column are based off of manually identified RFI and therefore the ground truth is uncertain especially in the low SNR limit for RFI. Our real HERA data included observations from LSTs of 0 ≤ t ≤ 5 h and across baseline lengths of 7 ≤ | ì b | ≤ 100 λ. Values in bold correspond to the best achieved result for that metric.  . The ROC curves were derived from each algorithm predicting on real HERA data visibilities (solid) and simulated HERA visibilities (broken). Black circles represent the optimal F 2 score. The Area Under the Curve (AUC) metric condenses the overall performance of our algorithms and tells us that the Amplitude-Phase network exhibits the best response on our real data with an AUC of 0.95. The TPR and FPRs for the real data (solid) are based on manually flagging RFI to the best of our ability to discern RFI from signals on the sky and therefore should not be taken as a ground truth.

RFI Classes
ities, coupled with an amplitude-phase DFCN we should be able to achieve an extremely effective first-round RFI flagger that reduces a common pipeline bottleneck. We do however recognize that the DFCN approach can have issues with identifying RFI bursts that occupy single timefrequency samples, what we called 'blips', and broadband bursts. This is most likely due to an imbalanced representation in our training dataset, and the loss optimization not being rewarded enough to drive the DFCNs to learn a subclass that appears at a rate of < 0.1%. This can be potentially overcome by fine-tuning the model by using transfer learning (Yosinski et al. 2014), and would involve a training dataset which consists almost entirely of these two subclasses, where the trained DFCN model shown here would serve as the starting point.
In near future build-outs of HERA there will need to be an extreme importance placed on reducing bottlenecks in the HERA data processing pipeline. The current Watershed RFI flagging algorithm does not scale particularly well, which puts this class of fully convolutional neural network as an ideal alternative. The eventual number of HERA dishes will total 350, which for a single 10 minute observation gives us 61,075 unique waterfall visibilities. In the amplitude-phase DFCN design outlined in this paper the RFI flagging throughput is 1.6×10 5 waterfalls/h/gpu 3 which compares to the Watershed RFI flagger at 7.4×10 3 on the same resources.
Future work related to the amplitude-phase DFCN 3 Performed on a single NVIDIA GeForce GTX TITAN could include a modification to a similarly styled comprehensive data quality classifier which should in-turn lead to improved results for sky based (Barry et al. 2016) and redundant calibration (Zheng et al. 2014), both of which requires exceptionally conditioned data. A strict binary classifier could be achieved by developing a training dataset that doesn't use a mock sky, but an accurately modeled sky with a proper HERA beam model. Of course it would also be possible and might be better suited by developing an observation derived training dataset in this instance, as failure modes are generally easier to identify in visibilities as opposed to contamination by RFI. It should also be possible to extend this work to arrays with better temporal resolution such as the MWA (Tingay et al. 2015) in the search for transients like Fast Radio Bursts (FRBs, Zhang et al. 2018). The additional phase information could potentially reduce the low-end limit of fluence for identification due to a more significant contrast between RFI and sky fringes.
The github repository for the RFI DFCN described in this paper can be found at https://github.com/UPennEoR/ ml_rfi.  Figure 6. A comparison between the three flagging algorithms described in this paper as applied to a sub-band (157 -193 MHz) from the real HERA dataset, which has been flagged manually and has no known ground truth. Orange indicates true positives, white is false positives, and red represents false negatives. In this example the amplitude-phase fed DFCN ultimately has the best true positive outcome but, as seen in Table 4, both the DFCN algorithms take a more aggressive stance towards RFI resulting in higher rates of false positives when compared to the Watershed algorithm.  Figure 6 demonstrating how each RFI flagging algorithm performs on simulated HERA data from hera sim. Orange indicates True Positive, white is False Positive, and red is False Negative. The simulated waterfall visibility is of a 25λ baseline dominated by strong diffuse emissions from the de Oliveira-Costa et al. (2008) GSM. The Watershed algorithm's inability to discriminate between RFI and sky, as indicated by its higher false negative rate, in this instance hints that there is required fine-tuning of its kernel size and initial threshold hyperparameters, due to the spectral structure in our simulations.

D-FCN
The current algorithm used in the HERA analysis pipeline is the Watershed RFI Algorithm, which performs some preprocessing of the raw data before identifying and removing suspected RFI instances. Before performing feature extraction, a median filter is applied to the data. In one dimension, a median filter is defined by the radius of the kernel K, which is applied as a sliding window across the entire length of the input data vector. Specifically, given an input vector ì x = [x 0 , x 1 , . . . , x N ], the median filtered output for a given entryx i can be expressed as: where median() is a function which returns the median of the list of data. By construction, the list will have an odd number of elements in it, and so the median is guaranteed to be an entry in the list.
In two dimensions, the median filter is defined analogously to the one dimensional case, except that there are two filter radii (K t , K ν ) that define the median filter. Here we have used the subscripts t and ν to represent the time and frequency axes found in a visibility waterfall. In general these need not be the same, but in practice as part of the HERA pipeline, both have the same value of K t = K ν = 8. Empirically these values seem to fall into a "sweet spot" of parameter space, where the values were large enough that the overall algorithm catches the majority of RFI events (as verified by inspecting the visibilities by hand) while still remaining computationally tractable to run. Also, to ensure the output of the median filter has the same dimensionality as the input data, the arrays are padded with a reflection of the data that is K t or K ν elements long, rather than with zero values, to avoid discontinuous jumps at the boundaries.
Physically, the median filter has the property of generating a proxy for the underlying noise of the raw visibility data because of its differencing of neighboring timefrequency pixels, and helps detrend the smooth foreground structure that is quite prominent and exhibits a strong frequency dependence. Once the two-dimensional median filter has been computed for every point in the visibility, the output is a "noise" visibility. The standard deviation of this "noise" is computed, which is then used to convert the noise to modified z-scores. (That is, the value of the noise is divided by the standard deviation, to quantify how strong of an outlier a particular data point is.) An initial round of seeds is generated by identifying all of the 6σ outliers (the data points whose absolute valued z-scores is greater than six). Once the data has been pre-processed in this fashion, the watershed algorithm is used to identify all instances of RFI.
A watershed algorithm (or more correctly, a flood-fill algorithm, because the resulting image segments are not grouped or labeled) is then used to identify the remaining RFI instances in the waterfall 4 . Under the assumption that RFI events tend to have some coherency either in time (e.g., for narrow-band emission that is almost always on, such as ORBCOMM) or in frequency (e.g., for broad-band RFI events caused by lightning), the initial flags generated by finding 6σ outliers are extended to neighboring pixels if the absolute value of their z-score is greater than 2. These regions are extended until no neighboring 2σ values are encountered.
Algorithm 1 shows the pseudocode of the XRFI flagging algorithm. The algorithm takes in a waterfall of visibility data V i j (t, ν) and returns a set of flags f i j (t, ν) of the same dimensionality. There are three main phases: (i) Pre-process the visibility data.
(ii) Generate initial series of flags. (iii) Flood-fill around initial flags to generate full set of flags.
As currently implemented, the watershed XRFI algorithm operates on the absolute value of the visibility data, though it could be extended to operate on the real and imaginary components as well. When running the watershed XRFI algorithm in production, the most computationally expensive part is the two-dimensional median filter which has a time complexity of O(K t K ν ). The overall complexity is roughly O(N t N ν K t K ν ) for a waterfall visibility with dimensions N t × N ν . Thus, speeding up the median filter operation by decreasing the kernel size or leveraging GPU computing can provide a significant speedup.


Colorectal Cancer Histology Image Classification Using Stacked Ensembles

In this research, we propose the image processing and classification using image extraction and data mining with ensemble learning techniques. We apply image extraction to determine the appropriate subset of the initial features to be used later by the ensemble learning for inducing an accurate model to predict cancer from the colorectal cancer histology images. Our proposed ensemble image classification method consists of three main parts: the image pre-processing part to adjust the image contrast to show the clear nucleus that can be recognized as the cause of cancer, the image extraction part to extract only important features, and finally the model creation part that generate the model to be used later as an image-based predictor. The experimental results show that the proposed method can predict the colorectal cancer from the colon images with high accuracy.

I. INTRODUCTION
Currently, innovative technology has played a prominent role in human daily life in vast aspects including ubiquitous communication, smart transportation, and tele-medicine. The technology of the Internet of Thing (IoT) is constantly evolving to embed in so many machines and appliances that it makes the technology around us. The emergence of IoT also causes new structured and unstructured data to be generated and stored all the time. Such tremendous data urge a more practical and timely research on Machine Learning and Artificial Intelligence to meet the human demand and business needs. At present, there are many unstructured data waiting for an efficient method to utilize them for beneficial purpose.
The unstructured data are data that contain disorderly pattern. Such data are images, text conversation, voice, and other forms of data produced by the current smart applications. These data cannot be applied directly like those in a relational database that are stored with a well-formed schema. Therefore, the unstructured data such as images must be passed through several steps of image processing to convert unstructured data to structured data before applying them with the machine learning technique to turn quite useless data into valuable knowledge.
In medical research, the image data are visually used for early diagnostic to characterize stage of symptom in order to give appropriate advice to patients. For some cases, images can be used to predict the patient's disease. These image utilizations are based on the human expertise. To facilitate doctors with a systematic machine-based approach, many intelligent steps are needed since the image pre-processing up to the machine learning and predicting steps.
One image consists of many features as well as noise that can occur during the data collection process. It is challenging to extract only features of interest from initial features. The two image processing steps, image pre-processing and image extraction, are necessary for image data preparation. Image pre-processing steps such as removing noise and adjusting image color are for preparing images to be ready for future use. Image extraction is for detecting objects or extracting a dominant features with various techniques from pictures resulting in structured or unstructured data depending on the selected technique. The well prepared images can be further used in the machine learning process.
Machine learning technique can learn the statistical model from image data and use that model for future diagnostic prediction. At present, one of the most accurate machine learning techniques is ensemble learning that uses multiple learning algorithms to collaboratively predict data. because each set of data will be effective with some learning algorithm and some researches that are proposed to be used Ensemble techniques with medical image data.
Many researchers had applied ensemble learning in the medical image domain. Gupta and Bhavsar [1] built classifiers from the breast cancer histopathological image data with ensemble learning that consists of four techniques: SVM, decision tree, kNN, and discriminant analysis. Fabio et al. [2] uses six feature extraction techniques: LBP, CLBP, LPQ, GLCM, PFTAS, and ORB to extract color-texture features from images with ensemble technique to classify breast cancer. Chaiyakhan et al. [3] applied image processing on the mammography images to adjust image quality and extract three significant features including texture, shape, and intensity histogram to be further used by SVM to classify breast cancer. In this work, we propose a technique to classify colon cancer from images prepared with immunohistochemical staining technique to separate the nuclei from the image. We extract significant image features with three techniques: gray-level co-occurrence matrix, local binary pattern, and histogram-based features. We then apply stacked ensemble technique to generate the model for cancer classification.

A. Immunohistochemical Staining
In general, hematoxylin and eosin are staining techniques used for pathological biopsy diagnoses. But in some cases like infectious disease and cancer, other kind of staining technique such as immunohistochemistry is more effective. Immunohistochemistry (IHC) is the method for detection of antigens on the cell and nucleus and this method has been used extensively to diagnose tumor markers, hormone, enzyme, protein, bacteria, and virus [4].
Ruifrok et al. [5] proposed the color separation method on IHC image from RGB camera by color deconvolution. The color in each of the RGB channels has been converted to the matrix for the combination of Hematoxylin, Eosin, and DAB as shown in Fig. 1. The intensity of light after transmitted the specimen can be computed [5] with equation (1). (1) The optical density (OD) for each of the RGB channels can be computed with equation (2). (2) where is the intensity of light entering the specimen, c is the absorption factor, and A is the amount of stain. Color deconvolution, which can be computed with equation (3), is the separation of the stains with normalization of the OD vector. (3)

B. Noise Removal
The median filter is the nonlinear noise reduction which often used as noise removal within the image [6]. It is used in the pre-processing step to adjust the image to be smooth and clear, while retaining image quality such as image clarity and edge contour.

C. Contrast Adjustment
Gamma correction or image enhancement is the technique to enhance the intensity of the gray-level of the object in the area of interest within the image to be clearer, which can help improving the image classification. Gamma correction is the nonlinear method to adjust the brightness of the image to be appropriate by adjusting the parameter called gamma [7], which can be computed with equation (4). (4) where γ is the parameter to convert color intensity in the image. The value of γ that is less than 1 is to convert darkness to brightness, which is called encoding gamma or gamma compression. While γ > 1 is for increasing the intensity of colors in the dark area, which is called decoding gamma or gamma expansion.

D. Grey-Level Co-occurrence Matrix (GLCM)
The pattern in the image is useful for object identification in the interesting area. GLCM [8] is the technique for finding the features of pattern in the image including contrast, correlation, and homogeneity. Contrast is the clarity of the pattern, which can be computed with equation (5). Correlation is the co-occurrence of patterns, which can be computed with equation (6). Homogeneity of the patterns can be computed with equation (7).
where m is the width of the GLCM matrix, n is the height of the GLCM matrix, P(i,j) is the probability at position (i,j) of the GLCM matrix, µ x is the average by rows, µ y is the average by columns, σ x is the variance by rows, and σ y is the variance by columns.

E. Local Binary Pattern (LBP)
LBP is the feature extraction from images to get texture with the value agent of the 3x3 pixel using the center point of the 3x3 pixel group as the reference value for calculating values in the surrounding pixels. The result is in the form of a binary pattern [9]. LBP can be computed with equation (8). (8) where (x x ,y c ) is the pixel point of interesting, i p and i c are the pixel points around the pixel point of interesting, P is the number of pixel points.

F. Histogram Based Feature
The shape and other properties are often extracted from images as represented as histogram. The histogram normally contains four statistic features (mean, variance, skewness, and kurtosis) relating to color intensity in the image. Mean is the average of color intensity [10] and can be computed with equation (9). (9) Variance is the change in color intensity around the average ( ) and can be computed with equation (10). (10) Skewness is for checking the symmetry of the histogram and it can be computed with equation (11). If the histogram is symmetric, then the skewness value is 0.
Kurtosis is for checking whether the maximum and minimum points in a histogram are related to the normal distribution. It can be computed with equation (12). (12) We can find the population of grayscale intensity occurring in the image with the computation as in equation (13). (13) where i is 0, 1, 2, …, G-1, h is number of pixels in each grayscale intensity in the range from 0 to 255, G is level of grayscale, N is number of pixels in the horizontal-oriented image, M is number of pixels in the vertical-oriented image.

G. Ensemble Learning
Machine learning techniques have a variety of intrinsic characteristics that fit different kinds of data. The ensemble learning is a technique that tries to combine the advantages of many algorithms to yield a better predictive performance. Fig.  2 shows the concept of ensemble learning by building multiple models with the same or even different algorithms and then combine the outputs with various techniques such as majority vote or some other measures. Ensemble learning can be divided further into four classes of techniques [11]: voting, bagging, boosting, and stacking.
Voting technique builds models with multiple algorithms to make the model more diverse on the same the training dataset. The outputs are combined based on the majority vote method to predicted class of the new data [11].
Bagging is a technique to build multiple models from sampling data. The number of sampling datasets is based on the required number of nodes in an ensemble model. The predicting outcome is from the voting method [11].
Boosting is based on the concept of building multiple weak models (models with low accuracy) with different weighting values on the training dataset. The combined outputs are using weight of voting to predicted class of the new data [11].
Stacking is similar to the voting method in the process of building model; this process is called learning base-level classifiers. At the outcome combination step, several learning algorithms are used for predicting class of the new data; this process is called learning meta-classifier. The popular meta-learning algorithm is logistic regression [12], [13].   Fig. 3 shows the stacking ensemble algorithm, which consists of three steps that can be explained as follows.
Step 1: from line 4 to 7, is for building multiple models from several learning algorithms.
Step 2: from line 9 to 12, is for generating the new data from predictive results from step 1.
Step 3: from line 14 to 17, is for learning model with the chosen algorithm from data in step 2 and predicting class of the new data.

III. PROPOSED WORK
In this section, we present in detail the proposed process of colorectal cancer histology image classification using stacked ensembles. The idea is that we use the image pre-processing techniques for extracting the cell nucleus and for improving image quality, and then use the image extraction techniques for extracting features with the texture and gray-level color from the image. We finally use this result to create models for data classification.    Fig. 4 shows the concept of the proposed process which can be divided into three phases: image-preprocessing, image extraction, and building stacked ensembles. The first phase is image pre-processing to be applied for extracting nucleus with the immunohistochemical staining method, then improve image quality with noise removal with median filter technique, and finally adjusting contrast with gamma technique to make the nucleus in the image more clear. Image extraction phase starts with extracting features with three techniques including GLCM, LBP, and histogram. The result is new data features. GLCM uses contrast correlation and homogeneity on four directions (0 o , 45 o , 90 o and 135 o ). Histogram contains mean, variance, skewness, and kurtosis.
On the final phase, we build data classification model with the features obtained from the image extraction phases using ensemble method. The base-level in ensemble includes SVM, neural network, and logistic regression algorithms. For the meta-classifier, we use logistic regression algorithm.

IV. EXPERIMENTAL RESULTS
The proposed method has been experimented with 5,000 colorectal cancer histology images containing 8 different classes, including Tumor, Stroma, Complex, Lympho, Debris, Mucosa, Adipose, and Empty, as shown in Fig. 5. On performance evaluation step, we perform the holdout method in which 70% of data (3,500 images) are used for training, whereas the remaining 30% of data (1,500 images) are used for accuracy testing. Table I shows comparative accuracy and error results of classifiers built from a single-model scheme (kNN, decision tree, neural network, logistic regression, and SVM) versus an ensemble scheme (bagging, boosting, majority voting, and stacking). The training image data are prepared with various image processing techniques: GLCM, LBP, histogram, and the proposed image preparation steps. Raw data are used as a benchmark.
It can be seen that among all single-model classifiers, neural network shows the best performance at accuracy rate 0.578 on raw data. With our proposed image preparation steps that combine features from GLCM, LBP, and histogram techniques, neural network can improve its accuracy rate up to 0.861. The improvement rate is very considerable in SVM in which accuracy rate increases from 0.306 to 0.884. On ensemble scheme comparison, the stacking classifiers built from our proposed image preparation steps show the highest accuracy rate at 0.887.

V. CONCLUSION
In this research, we propose an image preparation and ensemble learning techniques to classify colon cancer from a set of histology images. Our aim is to be an alternative assistance for a doctor in screening patients. We consider that the colorectal cancer histology images contain multiple details that are difficult to separate cancerous cells from others. We design and demonstrate a technique of separating the nucleus from other surrounding objects in the images that had been prepared with the immunohistochemical staining technique, and then extract significant features from a color cancer histology images using image extraction techniques. Our model creation technique is based on the stacked ensemble technique with base-level contains three algorithms: ANN, SVM, and logistic regression. The meta-classifier level uses logistic regression algorithm. The experimental results show that our proposed method yields the best performance on classifying the cancerous cells.