Evaluation of image similarity by histogram intersection

Colour is the most widely used attribute in image retrieval and object recognition. A technique known as histogram intersection has been widely studied and is considered to be effective for color‐image indexing. The key issue of this algorithm is the selection of an appropriate color space and optimal quantization of the selected color space. The goal of this article is to measure the model performance in predicting human judgment in similarity measurement for various images, to explore the capability of the model with a wide set of color spaces, and to find the optimal quantization of the selected color spaces. Six color spaces and twelve quantization levels are involved in evaluating the performance of histogram intersection. The categorical judgment and rank order experiments were conducted to measure image similarity. The CIELAB color space was found to perform at least as good as or better than the other color spaces tested, and the ability to predict image similarity increased with the number of bins used in the histograms, for up to 512 bins (8 per channel). With more than 512 bins, further improvement was negligible for the image datasets used in this study. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 265–274, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20122     

A computational analysis of LCP methods for bilinear and concave quadratic programming

The use of a sequential linear complementarity problem (SLCP) algorithm for finding a global minimum of bilinear programming problem (BLP) or a concave quadratic program (CQP) is examined. The algorithm consists of solving a sequence of linear complementarity problems (LCP). A branch-and-bound method is also considered in this study. This algorithm is based on the reformulation of a BLP into an LCP with a linear function to minimize. Computational experience with small and medium scale BLPs and CQPs indicates that the SLCP algorithm is quite efficient in finding a global minimum (or at least a solution that is quite near the optimum), but it is, in general, unable to establish that such a solution has been found. An algorithm to find a lower-bound for the BLP can overcome this drawback in some cases. Furthermore the SLCP algorithm is shown to be robust and compares favorably with the branch-and-bound method and another alternative technique.     

Interaction of a ductile projectile with a brittle solid medium

The process of interaction of a ductile projectile with a many times harder brittle target is analyzed in the 500–1000 m/sec range of velocities. The effect of hardness of the target and its fragmentation on the penetration depth is shown.Translated from Problemy Prochnosti, No. 9, pp. 60–62, September, 1991.     

Parameter-Free Equation-of-State Calculations for MgO and ZrO2

The electronic band structure of ZrO₂ is calculated for the fluorite structure using the self-consistent augmented-plane-wave method in the muffin-tin approximation. The crystal charge density is then site decomposed by fitting Slater orbitals to the wave functions in the muffin tins. The resultant charge densities for Zr⁴⁺ and O²⁻ are then used in the Gordon-Kim method to derive pair potentials, from which a number of structural, elastic, and thermodynamic properties are calculated and compared with experimental results and similar calculations for MgO.