Efficient content-based image retrieval based on multi-feature fusion

The increased availability of image capturing devices has enabled collections of digital images to rapidly expand in both size and diversity. This has created a constantly growing need for efficient and effective image browsing, searching, and retrieval tools. Pseudo-relevance feedback (PRF) has proven to be an effective mechanism for improving retrieval accuracy. An original, simple yet effective rank-based PRF mechanism (RB-PRF) that takes into account the initial rank order of each image to improve retrieval accuracy is proposed. This RB-PRF mechanism innovates by making use of binary image signatures to improve retrieval precision by promoting images similar to highly ranked images and demoting images similar to lower ranked images. Empirical evaluations based on standard benchmarks, namely Wang, Oliva & Torralba, and Corel datasets demonstrate the effectiveness of the proposed RB-PRF mechanism in image retrieval.

Scouts, Promoters, and Connectors: The Roles of Ratings in Nearest-Neighbor Collaborative Filtering

Recommender systems aggregate individual user ratings into predictions of products or services that might interest visitors. The quality of this aggregation process crucially affects the user experience and hence the effectiveness of recommenders in e-commerce. We present a characterization of nearest-neighbor collaborative filtering that allows us to disaggregate global recommender performance measures into contributions made by each individual rating. In particular, we formulate three roles-scouts, promoters, and connectors-that capture how users receive recommendations, how items get recommended, and how ratings of these two types are themselves connected, respectively. These roles find direct uses in improving recommendations for users, in better targeting of items and, most importantly, in helping monitor the health of the system as a whole. For instance, they can be used to track the evolution of neighborhoods, to identify rating subspaces that do not contribute ( or contribute negatively) to system performance, to enumerate users who are in danger of leaving, and to assess the susceptibility of the system to attacks such as shilling. We argue that the three rating roles presented here provide broad primitives to manage a recommender system and its community.

Structure determination and biochemical studies on Bacillus stearothermophilus E53Q serine hydroxymethyltransferase and its complexes provide insights on function and enzyme memory

Serine hydroxymethyltransferase (SHMT) belongs to the alpha-family of pyridoxal 5'-phosphate-dependent enzymes and catalyzes the reversible conversion of L-Ser and etrahydrofolate to Gly and 5,10-methylene tetrahydrofolate. 5,10-Methylene tetrahydrofolate serves as a source of one-carbon fragment in many biological processes. SHMT also catalyzes the tetrahydrofolate-independent conversion of L-allo-Thr to Gly and acetaldehyde. The crystal structure of Bacillus stearothermophilus SHMT (bsSHMT) suggested that E53 interacts with the substrate, L-Ser and etrahydrofolate. To elucidate the role of E53, it was mutated to Q and structural and biochemical studies were carried out with the mutant enzyme. The internal aldimine structure of E53QbsSHMT was similar to that of the except for significant changes at Q53, Y60 and Y61. The wild-type enzyme, carboxyl of Gly and side chain of L-Ser were in two conformations in the respective external aldimine structures. The mutant enzyme was completely inactive for tetrahydrofolate-depen dent cleavage of L-Ser, whereas there was a 1.5-fold increase in the rate of tetrahydrofolate-independent reaction with L-allo-Thr. The results obtained from these studies suggest that E53 plays an essential role in tetrahydrofolate/5-formyl tetrahydrofolate binding and in the proper positioning of C beta of L-Ser for direct attack by N5 of tetrahydrofolate. Most interestingly, the structure of the complex obtained by cocrystallization of E53QbsSHMT with Gly and 5-formyl tetrahydrofolate revealed the gem-diamine form of pyridoxal 5'-phosphate bound to Gly and active site Lys. However, density for 5-formyl tetrahydrofolate was not observed. Gly carboxylate was in a single conformation, whereas pyridoxal 5'-phosphate had two distinct conformations. The differences between the structures of this complex and Gly external aldimine suggest that the changes induced by initial binding of 5-formyl tetrahydrofolate are retained even though 5-formyl tetrahydrofolate is absent in the final structure. Spectral studies carried out with this mutant enzyme also suggest that 5-formyl tetrahydrofolate binds to the E53QbsSHMT-Gly complex forming a quinonoid intermediate and falls off within 4 h of dialysis, leaving behind the mutant enzyme in the gemdiamine form. This is the first report to provide direct evidence for enzyme memory based on the crystal structure of enzyme complexes.

On Using Projective Relations for Calibration and Estimation in a Structured-Light Scanner

For structured-light scanners, the projective geometry between a projector-camera pair is identical to that of a camera-camera pair. Consequently, in conjunction with calibration, a variety of geometric relations are available for three-dimensional Euclidean reconstruction. In this paper, we use projector-camera epipolar properties and the projective invariance of the cross-ratio to solve for 3D geometry. A key contribution of our approach is the use of homographies induced by reference planes, along with a calibrated camera, resulting in a simple parametric representation for projector and system calibration. Compared to existing solutions that require an elaborate calibration process, our method is simple while ensuring geometric consistency. Our formulation using the invariance of the cross-ratio is also extensible to multiple estimates of 3D geometry that can be analysed in a statistical sense. The performance of our system is demonstrated on some cultural artifacts and geometric surfaces.

Second order cone programming approaches for handling missing and uncertain data

We propose a novel second order cone programming formulation for designing robust classifiers which can handle uncertainty in observations. Similar formulations are also derived for designing regression functions which are robust to uncertainties in the regression setting. The proposed formulations are independent of the underlying distribution, requiring only the existence of second order moments. These formulations are then specialized to the case of missing values in observations for both classification and regression problems. Experiments show that the proposed formulations outperform imputation.

An improved representation of vehicle incompatibility in frontal NCAP tests using a modified rigid barrier

With the objective of better understanding the significance of New Car Assessment Program (NCAP) tests conducted by the National Highway Traffic Safety Administration (NHTSA), head-on collisions between two identical cars of different sizes and between cars and a pickup truck are studied in the present paper using LS-DYNA models. Available finite element models of a compact car (Dodge Neon), midsize car (Dodge Intrepid), and pickup truck (Chevrolet C1500) are first improved and validated by comparing theanalysis-based vehicle deceleration pulses against corresponding NCAP crash test histories reported by NHTSA. In confirmation of prevalent perception, simulation-bascd results indicate that an NCAP test against a rigid barrier is a good representation of a collision between two similar cars approaching each other at a speed of 56.3 kmph (35 mph) both in terms of peak deceleration and intrusions. However, analyses carried out for collisions between two incompatible vehicles, such as an Intrepid or Neon against a C1500, point to the inability of the NCAP tests in representing the substantially higher intrusions in the front upper regions experienced by the cars, although peak decelerations in cars arc comparable to those observed in NCAP tests. In an attempt to improve the capability of a front NCAP test to better represent real-world crashes between incompatible vehicles, i.e., ones with contrasting ride height and lower body stiffness, two modified rigid barriers are studied. One of these barriers, which is of stepped geometry with a curved front face, leads to significantly improved correlation of intrusions in the upper regions of cars with respect to those yielded in the simulation of collisions between incompatible vehicles, together with the yielding of similar vehicle peak decelerations obtained in NCAP tests.

A physical mechanism for North Atlantic SST influence on the Indian summer monsoon

A link between the Atlantic Multidecadal Oscillation (AMO) and multidecadal variability of the Indian summer monsoon rainfall is unraveled and a long sought physical mechanism linking Atlantic climate and monsoon has been identified. The AMO produces persistent weakening (strengthening) of the meridional gradient of tropospheric temperature (TT) by setting up negative (positive) TT anomaly over Eurasia during northern late summer/autumn resulting in early (late) withdrawal of the south west monsoon and persistent decrease (increase) of seasonal monsoon rainfall. On inter-annual time scales, strong North Atlantic Oscillation (NAO) or North Annular mode (NAM) influences the monsoon by producing similar TT anomaly over Eurasia. The AMO achieves the interdecadal modulation of the monsoon by modulating the frequency of occurrence of strong NAO/NAM events. This mechanism also provides a basis for explaining the observed teleconnection between North Atlantic temperature and the Asian monsoon in paleoclimatic proxies. Citation: Goswami, B. N., M. S. Madhusoodanan, C. P. Neema, and D. Sengupta (2006), A physical mechanism for North Atlantic SST influence on the Indian summer monsoon

Constructing Reeb Graphs using Cylinder Maps

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains.

Joint Power Control, Scheduling and Routing for Multihop Energy Harvesting Sensor Networks

We study wireless multihop energy harvesting sensor networks employed for random field estimation. The sensors sense the random field and generate data that is to be sent to a fusion node for estimation. Each sensor has an energy harvesting source and can operate in two modes: Wake and Sleep. We consider the problem of obtaining jointly optimal power control, routing and scheduling policies that ensure a fair utilization of network resources. This problem has a high computational complexity. Therefore, we develop a computationally efficient suboptimal approach to obtain good solutions to this problem. We study the optimal solution and performance of the suboptimal approach through some numerical examples.

Algorithms for Colouring Random k-colourable Graphs

The k-colouring problem is to colour a given k-colourable graph with k colours. This problem is known to be NP-hard even for fixed k greater than or equal to 3. The best known polynomial time approximation algorithms require n(delta) (for a positive constant delta depending on k) colours to colour an arbitrary k-colourable n-vertex graph. The situation is entirely different if we look at the average performance of an algorithm rather than its worst-case performance. It is well known that a k-colourable graph drawn from certain classes of distributions can be ii-coloured almost surely in polynomial time. In this paper, we present further results in this direction. We consider k-colourable graphs drawn from the random model in which each allowed edge is chosen independently with probability p(n) after initially partitioning the vertex set into ii colour classes. We present polynomial time algorithms of two different types. The first type of algorithm always runs in polynomial time and succeeds almost surely. Algorithms of this type have been proposed before, but our algorithms have provably exponentially small failure probabilities. The second type of algorithm always succeeds and has polynomial running time on average. Such algorithms are more useful and more difficult to obtain than the first type of algorithms. Our algorithms work as long as p(n) greater than or equal to n(-1+is an element of) where is an element of is a constant greater than 1/4.

Semi-Supervised Classification Using Sparse Gaussian Process Regression

Gaussian Processes (GPs) are promising Bayesian methods for classification and regression problems. They have also been used for semi-supervised learning tasks. In this paper, we propose a new algorithm for solving semi-supervised binary classification problem using sparse GP regression (GPR) models. It is closely related to semi-supervised learning based on support vector regression (SVR) and maximum margin clustering. The proposed algorithm is simple and easy to implement. It gives a sparse solution directly unlike the SVR based algorithm. Also, the hyperparameters are estimated easily without resorting to expensive cross-validation technique. Use of sparse GPR model helps in making the proposed algorithm scalable. Preliminary results on synthetic and real-world data sets demonstrate the efficacy of the new algorithm.