The problem we will consider in this paper is binary image restoration. It is, in essence, difficult to solve because of the combinatorial nature of the problem. To overcome this difficulty, we propose a new minimizat...
详细信息
The problem we will consider in this paper is binary image restoration. It is, in essence, difficult to solve because of the combinatorial nature of the problem. To overcome this difficulty, we propose a new minimization model by making use of a new variable to enforce the image to be binary. Based on the proposed minimization model, we present a fast alternating minimization algorithm for binary image restoration. We prove the convergence of the proposed alternating minimization algorithm. Experimental results show that the proposed method is feasible and effective for binary image restoration.
With the advent of advanced energy management systems in distribution systems,there is a growing interest in rapid and reliable code for distribution system state estimation(DSSE)in large-scale *** DSSE methods employ...
详细信息
With the advent of advanced energy management systems in distribution systems,there is a growing interest in rapid and reliable code for distribution system state estimation(DSSE)in large-scale *** DSSE methods employed in the industry are based on load scaling as they are well suited to the abundance of *** to the paucity of real-time measurements in DSSE,phasor measurement units(PMUs)have been proposed as a potential solution to increase the estimation ***,load scaling methodologies are not extendable for exploiting *** paper proposes a high-performance DSSE method that can handle the PMUs together with all common measurement types in industrial *** using Wirtinger calculus,the method operates entirely in complex variables and employs the latest version of advanced vector extensions(AVX-2)to reap the maximum potential of computer processing *** paper highlights the derivation of complex DSSE in matrix form,from which one can infer the implications on code reliability and *** results are reported on large-scale multi-phase distribution systems,and they are contrasted with a publicly available code for DSSE in real *** simulation results show that loop unrolling in AVX-2 contributes about a two-fold increase in the solving speed.
In order to obtain faster and more accuracy transient tracking performances for non-positive plants, a fast proportional integral difference (PID) type parameter optimal iterative learning control algorithm is propose...
详细信息
In order to obtain faster and more accuracy transient tracking performances for non-positive plants, a fast proportional integral difference (PID) type parameter optimal iterative learning control algorithm is proposed. In the algorithm, the PID type operators are introduced to enhance convergence speed and a suitable set of basis functions is added to avoid the algorithm plunge into local optimal when the plant is not positive. Theoretic proof shows that the algorithm monotone convergence to zero no matter the system plant is positive or not. Finally, simulations show that the algorithm also has a faster convergence speed compare with other similar algorithms.
In order to obtain faster and more accuracy transient tracking performances in iterative domain, a high-order proportional integral difference type parameter optimal iterative learning control algorithm based on norm ...
详细信息
In order to obtain faster and more accuracy transient tracking performances in iterative domain, a high-order proportional integral difference type parameter optimal iterative learning control algorithm based on norm performance index is proposed. In the algorithm, the proportional integral difference type operator is introduced to expend the dimension of the algorithm and to increase the free-degree of the optimal parameter. Theoretic proof shows that the convergence of the algorithm is monotonic no matter the plant is positive or not, and the tracking error will converge monotonically to zero when the plant is positive. Finally, simulations show that the tracking error of the proposed algorithm converges monotonically and faster than other similar algorithms.
Many systems have been built to employ the delta-based iterative execution model to support iterative algorithms on distributed platforms by exploiting the sparse computational dependencies between data items of these...
详细信息
Many systems have been built to employ the delta-based iterative execution model to support iterative algorithms on distributed platforms by exploiting the sparse computational dependencies between data items of these iterative algorithms in a synchronous or asynchronous approach. However, for large-scale iterative algorithms, existing synchronous solutions suffer from slow convergence speed and load imbalance, because of the strict barrier between iterations;while existing asynchronous approaches induce excessive redundant communication and computation cost as a result of being barrier-free. In view of the performance trade-off between these two approaches, this paper designs an efficient execution manager, called Aiter-R, which can be integrated into existing delta-based iterative processing systems to efficiently support the execution of delta-based iterative algorithms, by using our proposed group-based iterative execution approach. It can efficiently and correctly explore the middle ground of the two extremes. A heuristic scheduling algorithm is further proposed to allow an iterative algorithm to adaptively choose its trade-off point so as to achieve the maximum efficiency. Experimental results show that Aiter-R strikes a good balance between the synchronous and asynchronous policies and outperforms state-of-the-art solutions. It reduces the execution time by up to 54.1% and 84.6% in comparison with existing asynchronous and the synchronous models, respectively.
Femtocell networks are expected to offer significant performance improvement with low cost. However, adaptive transmission based on maximising the sum rate of macro and femto networks requires perfect channel quality ...
详细信息
Femtocell networks are expected to offer significant performance improvement with low cost. However, adaptive transmission based on maximising the sum rate of macro and femto networks requires perfect channel quality information (CQI) of the macro and femto links. This assumption requires an infinite resolution feedback link, which is not always practical since it requires an excessive amount of bandwidth. This study considers the problem of maximising average sum rate under the constraint of average maximum power transmission at macro and femto users. A suboptimal iterative algorithm is developed for finding the optimal CQI quantisers as well as the discrete power and rate at macro and femto transmitter for each quantised CQI level so as to maximise the average sum rate of the system. The author's numerical results give the number of bits required to sufficiently represent the CQI to achieve almost the maximum sum rate attained using full knowledge of the CQI.
This paper presents a multiphysical modeling of a two-dimensional (2-D) reversible tubular solid oxide cell. The developed model can represent both a solid oxide electrolysis cell (SOEC) and solid oxide fuel cell (SOF...
详细信息
This paper presents a multiphysical modeling of a two-dimensional (2-D) reversible tubular solid oxide cell. The developed model can represent both a solid oxide electrolysis cell (SOEC) and solid oxide fuel cell (SOFC) operations. By taking into account of the electrochemical, fluidic, and thermal physical phenomena, the presented model can accurately describe the multiphysical effects inside a cell for both fuel cell and electrolysis cell operation under entire working range of cell current and temperature. In addition, an iterative solver is proposed which is used to solve the 2-D distribution of physical quantities along the tubular cell. The proposed model is suitable for embedded applications, such as real-time simulation or online diagnostic control. The reversible solid oxide cell model is then validated experimentally in both SOEC and SOFC configurations under different species partial pressures, operating temperatures, and current densities conditions.
Coherent diffractive imaging using a coherent X-ray source promises to be a useful microscopic method for imaging noncrystalline objects at high spatial resolution. In this article a simple method to estimate the cohe...
详细信息
Coherent diffractive imaging using a coherent X-ray source promises to be a useful microscopic method for imaging noncrystalline objects at high spatial resolution. In this article a simple method to estimate the coherently scattered signal as a function of resolution is presented, and it is shown that the required X-ray flux or dose scales as the inverse third power of resolution for a specimen of constant volume and density. A simulated case study using the proposed energy-recovery linac source is also presented, which confirms the estimated flux requirement.
PURPOSE: Total Variation (TV) minimization algorithm is a classical compressed sensing (CS) based iterative image reconstruction algorithm that can accurately reconstruct images from sparse-view projections in compute...
详细信息
PURPOSE: Total Variation (TV) minimization algorithm is a classical compressed sensing (CS) based iterative image reconstruction algorithm that can accurately reconstruct images from sparse-view projections in computed tomography (CT). However, the system matrix used in the algorithm is often too large to be stored in computer memory. The purpose of this study is to investigate a new TV algorithm based on image rotation and without system matrix to avoid the memory requirement of system matrix. METHODS: Without loss of generality, a rotation-based adaptive steepest descent-projection onto convex sets (R-ASD-POCS) algorithm is proposed and tested to solve the TV model in parallel beam CT. Specifically, simulation experiments are performed via the Shepp-Logan, FORBILD and real CT image phantoms are used to verify the inverse-crime capability of the algorithm and evaluate the sparse reconstruction capability and the noise suppression performance of the algorithm. RESULTS: Experimental results show that the algorithm can achieve inverse-crime, accurate sparse reconstruction and thus accurately reconstruct images from noisy projections. Compared with the classical ASD-POCS algorithm, the new algorithm may yield the similar image reconstruction accuracy without use of the huge system matrix, which saves the computational memory space significantly. Additionally, the results also show that R-ASD-POCS algorithm is faster than ASD-POCS. CONCLUSIONS: The proposed new algorithm can effectively solve the problem of using huge memory in large scale and iterative image reconstruction. Integrating with ASD-POCS frame, this no-system-matrix based scheme may be readily extended and applied to any iterative image reconstructions.
Passage-time densities are important for the detailed performance analysis of distributed computer and communicating systems. We provide a proof and demonstration of a practical iterative algorithm for extracting comp...
详细信息
Passage-time densities are important for the detailed performance analysis of distributed computer and communicating systems. We provide a proof and demonstration of a practical iterative algorithm for extracting complete passage-time densities from expressive semi-Markov systems. We end by showing its application to a distributed web-server cluster model of 15.9 million states. (c) 2004 Elsevier B.V. All rights reserved.
暂无评论