A Framework for Detecting Glaucomatous Progression in the Optic Nerve Head of an Eye Using Proper Orthogonal Decomposition

Glaucoma is the second leading cause of blindness worldwide. Often, the optic nerve head (ONH) glaucomatous damage and ONH changes occur prior to visual field loss and are observable in vivo. Thus, digital image analysis is a promising choice for detecting the onset and/or progression of glaucoma. In this paper, we present a new framework for detecting glaucomatous changes in the ONH of an eye using the method of proper orthogonal decomposition (POD). A baseline topograph subspace was constructed for each eye to describe the structure of the ONH of the eye at a reference/baseline condition using POD. Any glaucomatous changes in the ONH of the eye present during a follow-up exam were estimated by comparing the follow-up ONH topography with its baseline topograph subspace representation. Image correspondence measures of L-1-norm and L-2-norm, correlation, and image Euclidean distance (IMED) were used to quantify the ONH changes. An ONH topographic library built from the Louisiana State University Experimental Glaucoma study was used to evaluate the performance of the proposed method. The area under the receiver operating characteristic curves (AUCs) was used to compare the diagnostic performance of the POD-induced parameters with the parameters of the topographic change analysis (TCA) method. The IMED and L-2-norm parameters in the POD framework provided the highest AUC of 0.94 at 10 degrees. field of imaging and 0.91 at 15 degrees. field of imaging compared to the TCA parameters with an AUC of 0.86 and 0.88, respectively. The proposed POD framework captures the instrument measurement variability and inherent structure variability and shows promise for improving our ability to detect glaucomatous change over time in glaucoma management.

Decomposition technique for composite signals

A new method for decomposition of compo,.~itsei gnals is presented. It is shown that high freyuency portion of composite signal spectrum possesses information on echo structure. The proposed technique does not assume the shape of basic wavelet and does not place any restrictions on the amplitudes and arrival times of echoes inm the composite signal. In the absence of noise any desirrd resolution can he obtained The effect of sampling rate and jFequency window function on echo resolutio.~ are di.wussed. Voiced speech segment is considered as an example of conzpxite sigrnl to demonstrate the application of the decomposition technique.

An adaptive decomposition method for video

Scalable video coding (SVC) is an emerging standard built on the success of advanced video coding standard (H.264/AVC) by the Joint video team (JVT). Motion compensated temporal filtering (MCTF) and Closed loop hierarchical B pictures (CHBP) are two important coding methods proposed during initial stages of standardization. Either of the coding methods, MCTF/CHBP performs better depending upon noise content and characteristics of the sequence. This work identifies other characteristics of the sequences for which performance of MCTF is superior to that of CHBP and presents a method to adaptively select either of MCTF and CHBP coding methods at the GOP level. This method, referred as "Adaptive Decomposition" is shown to provide better R-D performance than of that by using MCTF or CRBP only. Further this method is extended to non-scalable coders.

Spinodal decomposition of a Co-Ti-Nb alloy

The microstructural evolution on aging a Co-3 wt pct Ti-2 wt pct Nb alloy has been followed by transmission electron microscopy and diffraction to show that the solid solution decomposed by the spinodal mode. The strengthening observed has been correlated with the differences in lattice parameters of the coexisting phases. The several stages of coarsening have been documented to yield information about their kinetics and morphological changes.Formerly Visiting Assistant Professor, Department of Mechanical and Industrial Engineering, University of Illinois at Urbana-Champaign, 1206 West Green Street, Urbana, IL 61801, is with .

Oxidation and decomposition of NH3 over combustion synthesized Al2O3 and CeO2 supported Pt, Pd and Ag catalysts

The catalytic oxidation and decomposition of NH3 have been carried out over combustion synthesized Al2O3 and CeO2 supported Pt, Pd and Ag catalysts using temperature programmed reaction (TPR) technique in a packed bed tubular reactor. Metals are ionically dispersed over CeO2 and fine metal particles are found on Al2O3. NH3 oxidation occurs over 1% Pt/Al2O3, 1% Pd/Al2O3 and 1% Ag/Al2O3 at 175, 270 and 350 C respectively producing N-2, NO, N2O and H2O, whereas 1% Pt/CeO2, 1% Pd/CeO2 and 1% Ag/CeO2 give N-2 along with NO, N2O and H2O at 200, 225 and 250degreesC respectively. N-2 predominates over other nitrogen-containing products during the reaction on all catalysts. At less O-2 concentration, N-2 and H2O are the only products obtained during NH3 Oxidation. NH3 decomposition over all the catalysts occurs above 450degreesC.

Approximation of Spatio-Temporal Random Processes Using Tensor Decomposition

A new representation of spatio-temporal random processes is proposed in this work. In practical applications, such processes are used to model velocity fields, temperature distributions, response of vibrating systems, to name a few. Finding an efficient representation for any random process leads to encapsulation of information which makes it more convenient for a practical implementations, for instance, in a computational mechanics problem. For a single-parameter process such as spatial or temporal process, the eigenvalue decomposition of the covariance matrix leads to the well-known Karhunen-Loeve (KL) decomposition. However, for multiparameter processes such as a spatio-temporal process, the covariance function itself can be defined in multiple ways. Here the process is assumed to be measured at a finite set of spatial locations and a finite number of time instants. Then the spatial covariance matrix at different time instants are considered to define the covariance of the process. This set of square, symmetric, positive semi-definite matrices is then represented as a third-order tensor. A suitable decomposition of this tensor can identify the dominant components of the process, and these components are then used to define a closed-form representation of the process. The procedure is analogous to the KL decomposition for a single-parameter process, however, the decompositions and interpretations vary significantly. The tensor decompositions are successfully applied on (i) a heat conduction problem, (ii) a vibration problem, and (iii) a covariance function taken from the literature that was fitted to model a measured wind velocity data. It is observed that the proposed representation provides an efficient approximation to some processes. Furthermore, a comparison with KL decomposition showed that the proposed method is computationally cheaper than the KL, both in terms of computer memory and execution time.

ELISA: An Estimated Load Information Scheduling Algorithm for Distributed Computing Systems

In this paper, we present a decentralized dynamic load scheduling/balancing algorithm called ELISA (Estimated Load Information Scheduling Algorithm) for general purpose distributed computing systems. ELISA uses estimated state information based upon periodic exchange of exact state information between neighbouring nodes to perform load scheduling. The primary objective of the algorithm is to cut down on the communication and load transfer overheads by minimizing the frequency of status exchange and by restricting the load transfer and status exchange within the buddy set of a processor. It is shown that the resulting algorithm performs almost as well as a perfect information algorithm and is superior to other load balancing schemes based on the random sharing and Ni-Hwang algorithms. A sensitivity analysis to study the effect of various design parameters on the effectiveness of load balancing is also carried out. Finally, the algorithm's performance is tested on large dimensional hypercubes in the presence of time-varying load arrival process and is shown to perform well in comparison to other algorithms. This makes ELISA a viable and implementable load balancing algorithm for use in general purpose distributed computing systems.

Modeling of sonochemical decomposition of CCI4 in aqueous solutions

In the context of removal of organic pollutants from wastewater, sonolysis of CCl4 dissolved in water has been widely investigated. These investigations are either completely experimental or correlate data empirically. In this work, a quantitative model is developed to predict the rate of sonolysis of aqueous CCl4. The model considers the isothermal growth and partially adiabatic collapse of cavitation bubbles containing gas and vapor leading to conditions of high temperatures and pressures in them, attainment of thermodynamic equilibrium at the end of collapse, release of bubble contents into the liquid pool, and reactions in the well-mixed pool. The model successfully predicts the extent of degradation of dissolved CCl4, and the influence of various parameters such as initial concentration of CCl4, temperature, and nature of gas atmosphere above the liquid. in particular, it predicts the results of Hua and Hoffmann (Environ. Sci Technol, 1996, 30, 864-871), who found that degradation is first order with CCl4 and that Argon as well as Ar-O-3 atmospheres give the same results. The framework of the model is capable of quantitatively describing the degradation of many dissolved organics by considering all the involved species.

G(its)(2) VSR: An Information Theoretic Secure Verifiable Secret Redistribution Protocol for Long-term Archival Storage

Protocols for secure archival storage are becoming increasingly important as the use of digital storage for sensitive documents is gaining wider practice. Wong et al.[8] combined verifiable secret sharing with proactive secret sharing without reconstruction and proposed a verifiable secret redistribution protocol for long term storage. However their protocol requires that each of the receivers is honest during redistribution. We proposed[3] an extension to their protocol wherein we relaxed the requirement that all the recipients should be honest to the condition that only a simple majority amongst the recipients need to be honest during the re(distribution) processes. Further, both of these protocols make use of Feldman's approach for achieving integrity during the (redistribution processes. In this paper, we present a revised version of our earlier protocol, and its adaptation to incorporate Pedersen's approach instead of Feldman's thereby achieving information theoretic secrecy while retaining integrity guarantees.