On the evaluation of unsupervised outlier detection: measures,datasets, and an empirical study

The evaluation of unsupervised outlier detection algorithms is a constant challenge in data mining research. Little is known regarding the strengths and weaknesses of different standard outlier detection models, and the impact of parameter choices for these algorithms. The scarcity of appropriate benchmark datasets with ground truth annotation is a significant impediment to the evaluation of outlier methods. Even when labeled datasets are available, their suitability for the outlier detection task is typically unknown. Furthermore, the biases of commonly-used evaluation measures are not fully understood. It is thus difficult to ascertain the extent to which newly-proposed outlier detection methods improve over established methods. In this paper, we perform an extensive experimental study on the performance of a representative set of standard k nearest neighborhood-based methods for unsupervised outlier detection, across a wide variety of datasets prepared for this purpose. Based on the overall performance of the outlier detection methods, we provide a characterization of the datasets themselves, and discuss their suitability as outlier detection benchmark sets. We also examine the most commonly-used measures for comparing the performance of different methods, and suggest adaptations that are more suitable for the evaluation of outlier detection results.     

Fast intra prediction algorithm based on texture analysis for 3D-HEVC encoders

The advances in display technologies and the growing popularity of 3D video systems have attracted more consumers for 3D viewing experiences, and, consequently, the demand for storage and transmission of 3D video content is increasing. To cope with this demand, a 3D video extension of high-efficiency video coding (HEVC) standard is being developed and near the final standardization stage. The upcoming 3D-HEVC standard is expected to provide higher encoding efficiency than its predecessors, supporting multiple views with high resolution, at a cost of considerable increase in computational complexity, which can be an obstacle to its use in real-time applications. This article proposes a novel complexity reduction algorithm developed to optimize the 3D-HEVC intra mode decision targeting real-time video processing for consumer devices with limited computational power, such as 3D camcorders and smartphones equipped with multiple cameras and depth acquisition capabilities. The proposed algorithm analyzes the texture frames and depth maps to estimate the orientation of edges present in the prediction unit data, speeding up the intra prediction process and reducing the 3D-HEVC encoding processing time. Experimental results demonstrate that the proposed algorithm can save 26 % in computational complexity on average with negligible loss of encoding efficiency. This solution contributes to make more feasible the compression of 3D videos targeting real-time applications in power-constrained devices.     

Characterizing peers communities and dynamics in a P2P live streaming system

Despite the large number of works devoted to understand P2P live streaming applications, most of them put forth so far rely on characterizing the static view of these systems. In this work, we characterize the SopCast, one of the most important P2P live streaming applications. We focus on its dynamics behavior as well as on the community formation phenomena. Our results show that SopCast presents a low overlay topology diameter and low end-to-end shortest path. In fact, diameter is smaller than 6 hops in almost 90 % of the observation time. More than 96 % of peers’ end-to-end connections present only 3 hops. These values combined may lead to low latencies and a fast streaming diffusion. Second, we show that communities in SopCast are well defined by the streaming data exchange process. Moreover, the SopCast protocol does not group peers according to their Autonomous System. In fact, the probability that a community contains 50 % of its members belonging to the same AS (when we observe the largest AS of our experiments) is lower then 10 %. Peers exchange more data with partners belonging to the same community instead of peers inside the same AS. For the largest AS we have, less than 18 % of peer traffic has been exchanged with another AS partners. Finally, our analysis provides important information to support the future design of more efficient P2P live streaming systems and new protocols that exploit communities’ relationships.     

A Genre-Aware Approach to Focused Crawling

Focused crawlers have as their main goal to crawl Web pages that are relevant to a specific topic or user interest, playing an important role for a great variety of applications. In general, they work by trying to find and crawl all kinds of pages deemed as related to an implicitly declared topic. However, users are often not simply interested in any document about a topic, but instead they may want only documents of a given type or genre on that topic to be retrieved. In this article, we describe an approach to focused crawling that exploits not only content-related information but also genre information present in Web pages to guide the crawling process. This approach has been designed to address situations in which the specific topic of interest can be expressed by specifying two sets of terms, the first describing genre aspects of the desired pages and the second related to the subject or content of these pages, thus requiring no training or any kind of preprocessing. The effectiveness, efficiency and scalability of the proposed approach are demonstrated by a set of experiments involving the crawling of pages related to syllabi of computer science courses, job offers in the computer science field and sale offers of computer equipments. These experiments show that focused crawlers constructed according to our genre-aware approach achieve levels of F1 superior to 88%, requiring the analysis of no more than 65% of the visited pages in order to find 90% of the relevant pages. In addition, we experimentally analyze the impact of term selection on our approach and evaluate a proposed strategy for semi-automatic generation of such terms. This analysis shows that a small set of terms selected by an expert or a set of terms specified by a typical user familiar with the topic is usually enough to produce good results and that such a semi-automatic strategy is very effective in supporting the task of selecting the sets of terms required to guide a crawling process.     

Real filter based on Mellin radial harmonics for scale-invariant pattern recognition

Several theoretical and experimental studies are developed in order to simplify the construction of filters based on Mellin radial harmonics (MRH) for scale-invariant pattern recognition. A real filter based on MRH is designed. The impulse response of the filter is a hermitic function, obtained by a suitable modification of a MRH component. This real filter has the same scale invariance as the conventional complex MRH filters, with the main advantage of its simplicity. Both computer simulations and optical experiments are presented.     

Color encoding for polychromatic single-channel optical pattern recognition

The common multichannel system for recognizing colored images is replaced by a color-encoded single-channel system. Amethod inspired by the Munsell color system is used for encoding the different colors as phase and amplitude functions. It is shown that for many practical cases the phase information part of the color code is sufficient for obtaining good results. An implementation based on a liquid-crystal television panel that works in a phase-modulation mode is suggested. Computer simulations that demonstrate the capabilities of the suggested method are given as well as a comparison with previously published multichannel performance.     

Design Optimization of Composite Prosthetic Tubes Using GA-ANN Algorithm Considering Tsai-Wu Failure Criteria

The investigation of possible failures in composite materials is a matter of very great importance, and the Tsai-Wu criterion is an effective criterion for analyzing those flaws in anisotropic materials and defining whether the material at a given load will or will not suffer structural failure. In this study, an optimization procedure is proposed to minimize the maximum value of Tsai-Wu of laminated composite tubes subject to axial loading. Artificial neural networks and genetic algorithms are chosen as optimization tools. The results of this study show that the developed algorithm converges faster. Then, the maximum Tsai-Wu value is used as the objective function and the fiber orientations are the constraints in the optimization process. The results yielded by them are compared and discussed. Optimal results are compared with respect to the usual initial design. The design approach is recommended for structures where composites are the key load-carrying members such as orthopedic prosthesis.     

A generalized layerwise higher-order shear deformation theory for laminated composite and sandwich plates based on isogeometric analysis

This paper presents a generalized layerwise higher-order shear deformation theory for laminated composite and sandwich plates. We exploit a higher-order shear deformation theory in each layer such that the continuity of the displacement and transverse shear stresses at the layer interfaces is ensured. Thanks for enforcing the continuity of the displacement and transverse shear stresses at an inner-laminar layer, the minimum number of variables is retained from the present theory in comparison with other layerwise theories. The method requires only five variables, the same as what obtained from the first- and higher-order shear deformation theories. In comparison with the shear deformation theories based on the equivalent single layer, the present theory is capable of producing a higher accuracy for inner-laminar layer shear stresses. The free boundary conditions of transverse shear stresses at the top and bottom surfaces of the plate are fulfilled without any shear correction factors. The discrete system equations are derived from the Galerkin weak form, and the solution is obtained by isogeometric analysis (IGA). The discrete form requires the C¹ continuity of the transverse displacement, and hence NURBS basis functions in IGA naturally ensure this condition. The laminated composite and sandwich plates with various geometries, aspect ratios, stiffness ratios and boundary conditions are studied. The obtained results are compared with the 3D elasticity solution, the analytical as well as numerical solutions based on various plate theories.