A model based factorization approach for dense 3D recovery from monocular video

Feature track matrix factorization based methods have been attractive solutions to the Structure-front-motion (Sfnl) problem. Group motion of the feature points is analyzed to get the 3D information. It is well known that the factorization formulations give rise to rank deficient system of equations. Even when enough constraints exist, the extracted models are sparse due the unavailability of pixel level tracks. Pixel level tracking of 3D surfaces is a difficult problem, particularly when the surface has very little texture as in a human face. Only sparsely located feature points can be tracked and tracking error arc inevitable along rotating lose texture surfaces. However, the 3D models of an object class lie in a subspace of the set of all possible 3D models. We propose a novel solution to the Structure-from-motion problem which utilizes the high-resolution 3D obtained from range scanner to compute a basis for this desired subspace. Adding subspace constraints during factorization also facilitates removal of tracking noise which causes distortions outside the subspace. We demonstrate the effectiveness of our formulation by extracting dense 3D structure of a human face and comparing it with a well known Structure-front-motion algorithm due to Brand.

A non-orthogonal distributed space-time coded protocol - Part 1:Signal model and design criteria

In this two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In Part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover GNAF protocol enables the use of sphere decoders at the destination with a non-exponential Maximum likelihood (ML) decoding complexity. In Part-II, several low decoding complexity code constructions are studied and a lower bound on the Diversity-Multiplexing Gain tradeoff of the GNAF protocol is obtained.

Information Theoretic Results for Three-User Cognitive Channels

In this paper, we introduce the three-user cognitive radio channels with asymmetric transmitter cooperation, and derive achievable rate regions under several scenarios depending on the type of cooperation and decoding capability at the receivers. Two of the most natural cooperation mechanisms for the three-user channel are considered here: cumulative message sharing (CMS) and primary-only message sharing (PMS). In addition to the message sharing mechanism, the achievable rate region is critically dependent on the decoding capability at the receivers. Here, we consider two scenarios for the decoding capability, and derive an achievable rate region for each one of them by employing a combination of superposition and Gel'fand-Pinsker coding techniques. Finally, to provide a numerical example, we consider the Gaussian channel model to plot the rate regions. In terms of achievable rates, CMS turns out to be a better scheme than PMS. However, the practical aspects of implementing such message-sharing schemes remain to be investigated.

A simple model for protein thermal denaturation

Whether proteins denature in all-or-none fashion or in a continuous fashion is as yet an unresolved problem. The all-or-none process implies that while the process of denaturation is going on, only two kinds of protein molecules can exist. One is completely unchanged and the other is altered. The altered protein molecules are indistinguishable. Underlying the 'continuum' models is the assumption that all the chains in a protein globule undergo similar changes so that it is enough to consider a single chain.

Improved retrieval of aerosol size-resolved properties from moderate resolution imaging spectroradiometer over India: Role of aerosol model and surface reflectance

We have compared the total as well as fine mode aerosol optical depth (tau and tau(fine)) retrieved by Moderate Resolution Imaging Spectroradiometer (MODIS) onboard Terra and Aqua (2001-2005) with the equivalent parameters derived by Aerosol Robotic Network (AERONET) at Kanpur (26.45 degrees N, 80.35 degrees E), northern India. MODIS Collection 005 (C005)-derived tau(0.55) was found to be in good agreement with the AERONET measurements. The tau(fine) and eta (tau(fine)/tau) were, however, biased low significantly in most matched cases. A new set of retrieval with the use of absorbing aerosol model (SSA similar to 0.87) with increased visible surface reflectance provided improved tau and tau(fine) at Kanpur. The new derivation of eta also compares well qualitatively with an independent set of in situ measurements of accumulation mass fraction over much of the southern India. This suggests that though MODIS land algorithm has limited information to derive size properties of aerosols over land, more accurate parameterization of aerosol and surface properties within the existing C005 algorithm may improve the accuracy of size-resolved aerosol optical properties. The results presented in this paper indicate that there is a need to reconsider the surface parameterization and assumed aerosol properties in MODIS C005 algorithm over the Indian region in order to retrieve more accurate aerosol optical and size properties, which are essential to quantify the impact of human-made aerosols on climate.

An Integrated Model of Designing

Current design models and frameworks describe various overlapping fragments of designing. However, little effort exists in consolidating these fragments into an integrated model. We propose a model of designing that integrates product and process facets of designing by combining activities, outcomes, requirements, and solutions. Validation of the model using video protocols of design sessions demonstrates that all the constructs are used naturally by designers but often not to the expected level, which hinders the variety and resulting novelty of the concepts developed in these sessions. To resolve this, a prescriptive framework for supporting design for variety and novelty is proposed and plans for its implementation are created. DOI: 10.1115/1.3467011]

General model of a foam bed reactor

A general model of a foam bed reactor has been developed which rigorously accounts for the extent of gas absorption with chemical reaction occurring in both the storage and foam sections. Its applicability extends to a wide spectrum of reaction velocities. The possibilities of the predominance of the bulk-liquid reaction in the storage section or the absorption with reaction in the foam section can be handled as merely special cases of the general analysis. The importance of foam for carrying out a particular gas-liquid reaction is characterised by a criterion in terms of the fractional rate of reaction in the foam section. Trends of variations in the concentrations of dissolved free A, solute B, and gas-phase A with time of operation of the reactor are presented. The nature of the variation in the fractional rate of reaction in the foam section with time, at different reaction velocities, and the effect of the liquid flow rate (across the storage section) on the transience are also illustrated. Finally, the predictions of the general model have been validated using the available experimental data on the oxidation of sodium sulphide in a foam bed reactor. The agreement between the experimental and the present theoretical information is fairly good, apart from being more insightful than all the previous models of this reactor.

On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model

Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under small field size conditions. In this work, we investigate the performance of CNECCs under the error model of the network where the edges are assumed to be statistically independent binary symmetric channels, each with the same probability of error pe(0 <= p(e) < 0.5). We obtain bounds on the performance of such CNECCs based on a modified generating function (the transfer function) of the CNECCs. For a given network, we derive a mathematical condition on how small p(e) should be so that only single edge network-errors need to be accounted for, thus reducing the complexity of evaluating the probability of error of any CNECC. Simulations indicate that convolutional codes are required to possess different properties to achieve good performance in low p(e) and high p(e) regimes. For the low p(e) regime, convolutional codes with good distance properties show good performance. For the high p(e) regime, convolutional codes that have a good slope ( the minimum normalized cycle weight) are seen to be good. We derive a lower bound on the slope of any rate b/c convolutional code with a certain degree.

Application of scaled particle theory to alkyl-aryl surfactants: a two zone model of micellar core

Scaled Particle Theory (SPT) has been applied to predict the total free energies of micellization of ionic as well as nonionic micellar systems containing an aryl ring. A modification of the previously developed model has been made, proposing a two-zone model of micellar core which corroborates with the structural information available for such systems. The results are in good agreement with experimental data and also confirm the dictating role of cavity forming free energies for such systems

Neural network modeling of associative memory: Beyond the Hopfield model

A number of neural network models, in which fixed-point and limit-cycle attractors of the underlying dynamics are used to store and associatively recall information, are described. In the first class of models, a hierarchical structure is used to store an exponentially large number of strongly correlated memories. The second class of models uses limit cycles to store and retrieve individual memories. A neurobiologically plausible network that generates low-amplitude periodic variations of activity, similar to the oscillations observed in electroencephalographic recordings, is also described. Results obtained from analytic and numerical studies of the properties of these networks are discussed.