A new model for automatic normalization of multitemporal satellite images using Artificial Neural Network and mathematical methods

Relative Radiometric Normalization is often required in remote sensing image analyses particularly in the land cover change detection process. Normalization process minimizes the radiometric differences between two images caused by inequalities in the acquisition conditions rather than changes in surface reflectance. A wide range of RRN methods have been developed to adjust linear models. This paper proposes an automated Relative Radiometric Normalization (RRN) method to adjust a non-linear model based on an Artificial Neural Network (ANN) and unchanged pixels. The proposed method includes the following stages: (1) automatic detection of unchanged pixels based on a new idea that uses CVA (Change Vector Análysis) method, PCA (Principal Component Analysis) transformation and K-means clustering technique, (2) evaluation of different architectures of perceptron neural networks to find the best architecture for this specific task and (3) use of the aforementioned network for normalizing the subject image. The method has been implemented on two images taken by the TM sensor. Experimental results confirm the effectiveness of the presented technique in the automatic detection of unchanged pixels and minimizing imaging condition effects (i.e., atmosphere and other effective parameters).     

Portfolio selection with a minimax measure in safety constraint

In this paper, we attempt to design a portfolio optimization model for investors who desire to minimize the variation around the mean return and at the same time wish to achieve better return than the worst possible return realization at every time point in a single period portfolio investment. The portfolio is to be selected from the risky assets in the equity market. Since the minimax portfolio optimization model provides us with the portfolio that maximizes (minimizes) the worst return (worst loss) realization in the investment horizon period, in order to safeguard the interest of investors, the optimal value of the minimax optimization model is used to design a constraint in the mean-absolute semideviation model. This constraint can be viewed as a safety strategy adopted by an investor. Thus, our proposed bi-objective linear programming model involves mean return as a reward and mean-absolute semideviation as a risk in the objective function and minimax as a safety constraint, which enables a trade off between return and risk with a fixed safety value. The efficient frontier of the model is generated using the augmented -constraint method on the GAMS software. We simultaneously solve the ratio optimization problem which maximizes the ratio of mean return over mean-absolute semideviation with same minimax value in the safety constraint. Subsequently, we choose two portfolios on the above generated efficient frontier such that the risk from one of them is less and the mean return from other portfolio is more than the respective quantities of the optimal portfolio from the ratio optimization model. Extensive computational results and in-sample and out-of-sample analysis are provided to compare the financial performance of the optimal portfolios selected by our proposed model with that of the optimal portfolios from the existing minimax and mean-absolute semideviation portfolio optimization models on real data from S&P CNX Nifty index.     

Automatic phasing of MR images. Part I: linearly varying phase

In spin-echo and well shimmed gradient-echo images, the phase of the complex image often varies linearly in both the readout and phase-encode directions. Thus, in principle, it is possible to display an image in absorption mode. However, manually determining the two first-order and one zero-order phase parameters needed to display an absorption-mode image is a formidable task. In this paper, the Bayesian calculations needed to automatically determine these parameters are presented, and the calculations are illustrated using spin-echo images.     

Image sharing scheme based on combination theory

We present a simple algorithm for sharing and hiding secret image based on combination theory. The secret image is firstly encrypted by matrix multiplications and then shared into many shadow images by multiplying binary random sampling matrices. The sampling matrices randomly assign the pixel values to the shadow images which satisfy a specific combination rule as a constrain, so that the (t, n) threshold secret sharing scheme can be implemented. Numerical experiments have demonstrated the effectiveness of this image sharing algorithm.