Real-time lane tracking using Rao-Blackwellized particle filter

A novel approach to real-time lane modeling using a single camera is proposed. The proposed method is based on an efficient design and implementation of a particle filter which applies the concepts of the Rao-Blackwellized particle filter (RBPF) by separating the state into linear and non-linear parts. As a result the dimensionality of the problem is reduced, which allows the system to perform in real-time in embedded systems. The method is used to determine the position of the vehicle inside its own lane and the curvature of the road ahead to enhance the performance of advanced driver assistance systems. The effectiveness of the method has been demonstrated implementing a prototype and testing its performance empirically on road sequences with different illumination conditions (day and nightime), pavement types, traffic density, etc. Results show that our proposal is capable of accurately determining if the vehicle is approaching the lane markings (Lane Departure Warning), and the curvature of the road ahead, achieving processing times below 2 ms per frame for laptop CPUs, and 12 ms for embedded CPUs.     

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.     

Multi-objective optimization with an adaptive resonance theory-based estimation of distribution algorithm

The introduction of learning to the search mechanisms of optimization algorithms has been nominated as one of the viable approaches when dealing with complex optimization problems, in particular with multi-objective ones. One of the forms of carrying out this hybridization process is by using multi-objective optimization estimation of distribution algorithms (MOEDAs). However, it has been pointed out that current MOEDAs have an intrinsic shortcoming in their model-building algorithms that hamper their performance. In this work, we put forward the argument that error-based learning, the class of learning most commonly used in MOEDAs is responsible for current MOEDA underachievement. We present adaptive resonance theory (ART) as a suitable learning paradigm alternative and present a novel algorithm called multi-objective ART-based EDA (MARTEDA) that uses a Gaussian ART neural network for model-building and a hypervolume-based selector as described for the HypE algorithm. In order to assert the improvement obtained by combining two cutting-edge approaches to optimization an extensive set of experiments are carried out. These experiments also test the scalability of MARTEDA as the number of objective functions increases.     

Managing Global Software Engineering: A Comparative Analysis of Offshore Outsourcing and the Internal Offshoring of Software Development

In this article, the authors compare offshore outsourcing and the internal offshoring of software development. Empirical evidence is presented from a case study conducted in five companies. Based on a detailed literature review, a framework was developed that guided the authors' analysis of the differences in the challenges faced by companies and the patterns of evolution in the practice of software development in each business model.     

Managing Citizen Profiles in the Domain of e-Government: The cPortfolio Project

The provision of support for holistic operations in the scope of a horizontal digital administration requires the fulfillment of a number of previous steps that guarantee the viability of services in the domain. One of these tasks is the proper management of documents. Documents are a key element of any democratic administration and their digital management is a clear pre-requisite for the arrival of digital government. This article tackles how this service can be provided using the support of semantics as a technological cornerstone. The implementation of such a tool is made through the so-called cPortfolio. This platform is deeply discussed and details about its design and implementation are provided. This system is designed to manage both the personal information from the citizen and the documents they possess. Tests on the prototype showed interesting features regarding the simplicity of use and the interoperability support provided to third party agents.     

Signal-adaptive discrete evolutionary transform as a sparse time–frequency representation

Discrete evolutionary transform (DET) has usually been applied to signals in a blind-way without using any parameters to characterize the signal. For this reason, it is not optimal and needs improvement by using some information about the signal. In this paper, we propose an improvement for the discrete evolutionary transform in order to obtain a sparse representation and redefine the generalized time-bandwidth product optimal short-time Fourier transform as a special case of it. In case of linear FM-type signals, the optimized kernel function of the transform is determined according to signal parameters including the instantaneous frequency. The performance of the adaptive-DET is illustrated on three distinct cases. In case of multi-component LFM signals, when the concentration of the proposed distribution is compared to the ordinary sinusoidal-DET, the improvement is computed as 28% in terms of the ratio of norms. Furthermore we define a new and a general class of distribution functions named as the short-time generalized discrete Fourier transform (ST-GDFT) which is a larger set of signal representations including the adaptive-DET.     

Characterization of Sky‐region Morphological‐temporal Airborne Collision Detection

Automated airborne collision‐detection systems are a key enabling technology for facilitating the integration of unmanned aerial vehicles (UAVs) into the national airspace. These safety‐critical systems must be sensitive enough to provide timely warnings of genuine airborne collision threats, but not so sensitive as to cause excessive false alarms. Hence, an accurate characterization of detection and false‐alarm sensitivity is essential for understanding performance tradeoffs, and system designers can exploit this characterization to help achieve a desired balance in system performance. In this paper, we experimentally evaluate a sky‐region, image‐based, aircraft collision‐detection system that is based on morphological and temporal processing techniques. (Note that the examined detection approaches are not suitable for the detection of potential collision threats against a ground clutter background.) A novel collection methodology for collecting realistic airborne collision‐course target footage in both head‐on and tail‐chase engagement geometries is described. Under (hazy) blue sky conditions, our proposed system achieved detection ranges greater than 1540 m in three flight test cases with no false‐alarm events in 14.14 h of nontarget data (under cloudy conditions, the system achieved detection ranges greater than 1170 m in four flight test cases with no false‐alarm events in 6.63 h of nontarget data). Importantly, this paper is the first documented presentation of detection range versus false‐alarm curves generated from airborne target and nontarget image data. © 2012 Wiley Periodicals, Inc.     

A document is known by the company it keeps: neighborhood consensus for short text categorization

During the last decades the Web has become the greatest repository of digital information. In order to organize all this information, several text categorization methods have been developed, achieving accurate results in most cases and in very different domains. Due to the recent usage of Internet as communication media, short texts such as news, tweets, blogs, and product reviews are more common every day. In this context, there are two main challenges; on the one hand, the length of these documents is short, and therefore, the word frequencies are not informative enough, making text categorization even more difficult than usual. On the other hand, topics are changing constantly at a fast rate, causing the lack of adequate amounts of training data. In order to deal with these two problems we consider a text classification method that is supported on the idea that similar documents may belong to the same category. Mainly, we propose a neighborhood consensus classification method that classifies documents by considering their own information as well as information about the category assigned to other similar documents from the same target collection. In particular, the short texts we used in our evaluation are news titles with an average of 8 words. Experimental results are encouraging; they indicate that leveraging information from similar documents helped to improve classification accuracy and that the proposed method is especially useful when labeled training resources are limited.     

LEGClust- a clustering algorithm based on layered entropic subgraphs.

Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.     

Modeling and solving the rooted distance-constrained minimum spanning tree problem

In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G=(V,E)$G=(V,E)$ with node set V={0,1,…,n}$V=\{0,1,\dots ,n\}$ and edge set E$E$, two integer weights, a cost _ce$c_e$ and a delay _we$w_e$ associated with each edge e$e$ of E$E$, and a natural (time limit) number H$H$, we wish to find a spanning tree T$T$ of the graph with minimum total cost and such that the unique path from a specified root node, node 0, to any other node has total delay not greater than H$H$. This problem generalizes the well known hop-constrained spanning tree problem and arises in the design of centralized networks with quality of service constraints and also in package shipment with service guarantee constraints. We present three theoretically equivalent modeling approaches, a column generation scheme, a Lagrangian relaxation combined with subgradient optimization procedure, both based on a path formulation of the problem, and a shortest path (compact) reformulation of the problem which views the underlying subproblem as defined in a layered extended graph. We present results for complete graph instances with up to 40 nodes. Our results indicate that the layered graph path reformulation model is still quite good when the arc weights are reasonably small. Lagrangian relaxation combined with subgradient optimization procedure appears to work much better than column generation and seems to be a quite reasonable approach to the problem for large weight, and even small weight, instances.