Automatic player position detection in basketball games

This paper presents us with a framework for the automatic player position detection (APPD) in the game of basketball. Court players are detected in the images broadcasted via television stations. In them, at any point of time, the view is from only one camera. This makes the detection process much more difficult. The player detection is based on the mixture of non-oriented pictorial structures. The detection of body parts is performed by the Support Vector Machine (SVM) algorithm. The results of these detections are combined together with constraints on their locations, which specify the position of one body part with respect to the parent body part. In order to train the whole model, we used a latent form of SVM called the latent SVM (LSVM). Such approach generated the statistical accuracy of about 82 %, which represents one of the best results in basketball player detection framework. Beside players, the algorithm detected a certain number of false positive objects. These are mostly people from the audience and the referees as well. This paper contains a simple and robust solution to remove them all, based on the play court boundaries and the histogram comparison. Separating players in different teams is done by k-means clustering. The inputs to this algorithm are saturation histograms calculated on the jerseys. A spatial transformation is determined by the detected play court boundaries and the actual court measures. Using this transformation, points representing the location of detected players in TV images are mapped to the actual location of players on the court, which was the main goal of our research. The proposed solution is sound and efficient. In addition, it is backed up by the experimental results obtained using the model of the actual footage of basketball games.     

meSAT: multiple encodings of CSP to SAT

One approach for solving Constraint Satisfaction Problems (CSP) (and related Constraint Optimization Problems (COP)) involving integer and Boolean variables is reduction to propositional satisfiability problem (SAT). A number of encodings (e.g., direct, log, support, order) for this purpose exist as well as specific encodings for some constraints that are often encountered (e.g., cardinality constraints, global constraints). However, there is no single encoding that performs well on all classes of problems and there is a need for a system that supports multiple encodings. We present a system that translates specifications of finite linear CSP problems into SAT instances using several well-known encodings, and their combinations. We also present a methodology for selecting a suitable encoding based on simple syntactic features of the input CSP instance. Thorough evaluation has been performed on large publicly available corpora and our encoding selection method improves upon the efficiency of existing encodings and state-of-the-art tools used in comparison.     

Aluminium electrodeposition from AlCl3-NaCl melts on glassy carbon,platinum and gold electrodes

The electrochemical deposition and dissolution of aluminium on glassy carbon, platinum and gold electrodes in chloraluminate melts have been investigated using linear sweep voltammetry and potentiostatic pulse techniques. It was shown that deposition of aluminium on the glassy carbon electrode at low overpotentials takes place by 3-D progressive nucleation and growth, with the incorporation of atoms in the crystal lattice as the rate-determining step. At overpotentials higher than –100 mV vs Al, in the melts containing more than 52 mol % of AlCl₃, diffusion of Al₂Cl ₇ ^– , takes over the control of deposition of aluminium. Alloying of platinum and gold electrodes with aluminium from the melt occurs in the underpotential region.     

Voltammetric and galvanostatic studies of hydrous and anhydrous iridium oxide films

Electrolytically grown hydrous oxide films on iridium wire electrodes have been thermally treated from 473 to 773 K. Anhydrous oxide films formed by this treatment have been subjected to cathodic polarization at the potential of the hydrogen evolution reaction, square-wave pulsing of potential from –0.25 to +1.25 V with respoect to SCE and to anodic galvanostatic polarization in 0.5 mol dm^–3 H₂SO₄. Cathodic pretreatment caused an increase of the voltammetric charge in the oxide formation region while the square-wave pulsing formed a hydrous oxide film whose voltammetric charge was superimposed on the charge of the anhydrous oxide film. Both procedures restored the hydrophilic nature of the electrode/solution interface. Potential-time curves during anodic galvanostatic polarization served as a diagnostic criterion for the stability and the state of the oxide film.     

Using static suffix array in dynamic application: Case of text compression by longest first substitution

Over the last decade, enhanced suffix arrays (ESA) have replaced suffix trees in many applications. Algorithms based on ESAs require less space, while allowing the same time efficiency as those based on suffix trees. However, this is only true when a suffix structure is used as a static index. Suffix trees can be updated faster than suffix arrays, which is a clear advantage in applications that require dynamic indexing. We show that for some dynamic applications a suffix array and the derived LCP-interval tree can be used in such a way that the actual index updates are not necessary. We demonstrate this in the case of grammar text compression with longest first substitution and provide the source code. The proposed algorithm has O(N²)$O(N^2)$ worst case time complexity but runs in O(N)$O(N)$ time in practice.     

Small‐signal and noise modeling of class of HEMTs using knowledge‐based artificial neural networks

In this article, the neural network approach is exploited for development of bias‐dependent small‐signal and noise models of a class of microwave field effect transistor (FETs) made in the same technology but differing in the gate width. The prior knowledge neural approach is applied. Introducing gate width at the input of proposed neural networks, as well as the S/noise parameters of a device that belongs to the same class as the modeled device representing the prior knowledge, leads to very accurate scattering and noise parameters' modeling, as exemplified by modeling of class of pseudomorphic high electron mobility transistor (pHEMT) devices. © 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.     

Collaborative spaces for GIS-based multimedia cartography in blended environments

The interaction spaces between instructors and learners in the traditional face-to-face classroom environment are being changed by the diffusion and adoption of many forms of computer-based pedagogy. An integrated understanding of these evolving interaction spaces together with how they interconnect and leverage learning are needed to develop meaningful strategies for effective teaching and learning. The 18i collaborative interaction spaces model was designed based on constructivist principles, and describes 18 mixed instructor–learner spaces contextualized at a finer operational scale that makes explicit a wider range of interactions. The model was implemented during the life cycle of an undergraduate GIS-based multimedia cartography course. One output was the generation of a repository of rule-based trajectory plans for rapid planning and problem solving. The model provides an integrated workflow to manage course contents, products, interactions, individuality, and learning styles in blended environments.     

Absolute calibration of photostimulable image plate detectors used as (0.5-20 MeV) high-energy proton detectors

In this paper, the absolute calibration of photostimulable image plates (IPs) used as proton detectors is presented. The calibration is performed in a wide range of proton energies (0.5-20 MeV) by exposing simultaneously the IP and calibrated detectors (radiochromic films and solid state detector CR39) to a source of broadband laser-accelerated protons, which are spectrally resolved. The final result is a calibration curve that enables retrieving the proton number from the IP signal.     

Comparative study of decay ratios of disturbance-rejection magnitude optimum method for PI controllers

One of the key time-domain closed-loop performance requirements is the closed-loop response decay ratio. In this paper, the decay ratios of the disturbance-rejection magnitude optimum (DRMO) tuning method [Vranci? D, Strmcnik S, Kocijan J. Improving disturbance rejection of PI controllers by means of the magnitude optimum method. ISA Trans 2004; 43: 73-84; Vranci? D, Strmcnik S. Achieving optimal disturbance rejection by using the magnitude optimum method. In: Pre-prints of the CSCC'99 conference. 1999. p. 3401-6] are analyzed and compared to decay ratios of two other modern tuning methods, i.e. the Kappa-Tau tuning method (based on time-domain step-response characteristics) [Astr?m KJ, H?gglund T. PID controllers: Theory, design, and tuning. 2nd ed. Instrument Society of America; 1995] and the non-convex optimization tuning method (based on frequency response) [Panagopoulos H, Astr?m KJ, H?gglund T. Design of PI controllers based on non-convex optimization. Automatica 1998; 34: 585-601; Panagopoulos H, Astr?m KJ, H?gglund T. Design of PID controllers based on constrained optimisation. IEE Proc Control Theory Appl 2002; 149 (1): 32-40]. It is shown that the DRMO method results in such a closed-loop response that the decay ratio is within a relatively narrow interval when compared to the other two methods.