The rise of the smartphone industry has increased the need for mobile capture of document images and with embedded applications. In the field of image processing, detecting keypoints and computing their associated fea...
详细信息
ISBN:
(纸本)9781538635865
The rise of the smartphone industry has increased the need for mobile capture of document images and with embedded applications. In the field of image processing, detecting keypoints and computing their associated features is the first step of numerous algorithms. However, keypoints detectors are mostly designed for real world images and usually don't behave well with document images. In this paper, we propose an idea which consists in guiding keypoints extraction by using the document layout information. We compare this approach with the CORE algorithm for confusion reduction, on three classical descriptors. Results show improvements in both matching quality and processing times.
Network functions virtualization (NFV) is increasingly adopted by telecommunications (telecos) service providers for cost savings and flexible management. However, deploying virtual network functions (VNFs) in geo-dis...
详细信息
ISBN:
(纸本)9781538627044
Network functions virtualization (NFV) is increasingly adopted by telecommunications (telecos) service providers for cost savings and flexible management. However, deploying virtual network functions (VNFs) in geo-distributed central offices (COs) is not straightforward. Unlike most existing centralized schemes in clouds, VNFs of a service chain usually need to be deployed in multiple COs due to limited resource capacity and uneven setup cost at various locations. To ensure the Quality of Service of service chains, a key problem for service providers is to determine where a VNF should go, in order to achieve cost-efficiency and load balancing of both computing and bandwidth resources, across all selected COs. To this end, we present a framework of CO Selection (CS) and VNF Assignment (VA) for distributed deployment of NFV. Specifically, we first select a set of COs that minimizes the communication cost among the selected COs. Then, we employ a shadow-routing based approach, which minimizes the maximum of appropriately defined CO utilizations, to jointly solve the VNF-CO and VNF-server assignment problem. Simulations demonstrate the effectiveness of CS algorithm, and asymptotic optimality, scalability and high adaptivity of the VNF assignment approach.
This paper discusses about the trajectory planning and controlled maneuvering of the vehicle in parking assist mode. The objective of the proposed algorithm is to use low-cost hardware like ultrasonic sensor in order ...
详细信息
ISBN:
(纸本)9781509060641
This paper discusses about the trajectory planning and controlled maneuvering of the vehicle in parking assist mode. The objective of the proposed algorithm is to use low-cost hardware like ultrasonic sensor in order to provide automated parking assist to the vehicle. The concept of grid occupancy is formulated in free space detection algorithm to compute lateral-longitudinal grid cell vacancy. The vehicle will enable automated parking assist mode for controlled maneuvering on completion of free space detection followed by path planning. The reference planned path is an optimized trajectory with single maneuver for the vehicle to traverse in a free parking space. The localized trajectory and control algorithm of the perpendicular parking have been designed with reference to perception sensor input. The controller facilitates the intelligent navigation of vehicle based on measured obstacle free clearance distance and reference point. The steering control algorithm based on fuzzy logic is designed to provide an optimized maneuvering of the host vehicle in perpendicular parking space. In order to ease parking effort, an innovative approach of combined feedback and feed-forward based fuzzy controller has been illustrated. The controller performance has been evaluated in simulation environment keeping vehicle dynamics model in loop. The test scenario has been modeled in Carmaker to substantiate the optimization of route selection and a smooth transition of vehicle in parking assist mode during maneuvering into an empty parking space.
Indirect measurements of physical parameters of interest often require a mathematical model in which these parameters are estimated accordingly to the gathered measurements. Within the Least Squares estimation, the pa...
详细信息
ISBN:
(纸本)9781509035960
Indirect measurements of physical parameters of interest often require a mathematical model in which these parameters are estimated accordingly to the gathered measurements. Within the Least Squares estimation, the parameters are estimated through a regression problem. The presence of dynamics, multiple sensors and high sampling rates lead to high dimensional regression matrices. This paper deals with solving such massive regression problems efficiently. We revisit Renaut's Least Squares Multisplitting (LSMS) technique aimed at solving the ordinary least squares problem in parallel. The LSMS decomposes the design matrix column-wise into several (possibly overlapping) blocks. The global least squares solution is subsequently replaced by an equivalent set of local least squares problems which are to be solved in parallel. At every iteration step the local solutions are recombined using an appropriate weighting scheme. This allows for a scalable and highly parallel implementation aimed at distributed systems. We study how to decompose the global estimation problem in smaller subproblems and quantify the effects of various possible partitions. The method is illustrated with dedicated numerical simulations and a toy application in the area of sensor fusion.
Resource constrained project scheduling problem (RCPSP) is one of the classical problems in the area of discrete optimization. In this paper we propose an algorithm for solving RCPSP which relies on an adaptive insert...
详细信息
ISBN:
(纸本)9781509046010
Resource constrained project scheduling problem (RCPSP) is one of the classical problems in the area of discrete optimization. In this paper we propose an algorithm for solving RCPSP which relies on an adaptive insertion mutation operator that targets different regions of the search space. Neighbourhoods are exploited via forward-backward iterative local search. Furthermore, the algorithm makes use of an archive to ensure better utilization of the schedule budget. The performance of the approach is analysed across various problem complexities associated with J30, J60 and J120 full instance sets of PSPLib with budgets of 1,000, 5,000 and 50,000 schedules. The study provides insights on the performance of the algorithm i.e. why the performance is good for particular instances and not as good for others.
Feature-based modeling is very popular in generating the shape and history of a product in a three-dimensional(3 D) CAD system. In the previous studies, features are the basic unit of the models. It o
ISBN:
(纸本)9781467389808
Feature-based modeling is very popular in generating the shape and history of a product in a three-dimensional(3 D) CAD system. In the previous studies, features are the basic unit of the models. It o
In this article, we propose a data analytics development to detect unusual patterns of flights from a vast amounts of FDR (flight data recorder) data for supporting airline maintenance operations. A fundamental ration...
详细信息
ISBN:
(纸本)9781509060641
In this article, we propose a data analytics development to detect unusual patterns of flights from a vast amounts of FDR (flight data recorder) data for supporting airline maintenance operations. A fundamental rationale behind this development is that if there are potential issues on mechanical parts of an aircraft during a flight, evidences for these issues are most likely included in the FDR data. Therefore, the data analysis of FDR data enables us to detect the potential issues in the aircraft before they occur. To this end, in a data pre-processing step, a data filtering, a data sampling, and a data transformation are sequentially performed. And then, in this analysis, all time series data in the FDR are classified into three types: a continuous signal, a discrete signal, and a warning signal. For each type of signal, a high-dimensional vector by arranging the time series data is chosen as features. In the feature section process, a correlation analysis, a correlation relaxation, and a dimension reduction are sequentially conducted. Finally, a type of k-nearest neighbor approach is applied to automatically identify the FDR data in which the unusual flight patterns are recorded from a large amount of FDR data. The proposed method is tested with using a realistic FDR data from the NASA's open database.
With the rapid technology development of systems that assist drivers, the lack of uniform support for efficient algorithm development has emerged. We propose a universal Software Development Kit (SDK) concept with com...
详细信息
ISBN:
(纸本)9781509055449
With the rapid technology development of systems that assist drivers, the lack of uniform support for efficient algorithm development has emerged. We propose a universal Software Development Kit (SDK) concept with common optimization routines that can be applied to typical Advanced Driver Assistance Systems (ADAS) algorithms. The evaluation confirmed that the SDK decreased execution time for ADAS algorithms and works seamlessly across different embedded architectures.
Valiant routing, the use of a random intermediate node to distribute network traffic, has been proposed for a number of recent HPC network topologies. It is also commonly used as a bulding block for adaptive routing a...
详细信息
ISBN:
(纸本)9781538610442
Valiant routing, the use of a random intermediate node to distribute network traffic, has been proposed for a number of recent HPC network topologies. It is also commonly used as a bulding block for adaptive routing algorithms, which use shortest path routes when possible, but revert to Valiant routing when necessary to avoid hot spots. We show that the version of Valiant routing proposed for the Slim fly topology can cause messages to follow loops, using an edge in both directions before returning to edges of the original shortest path. Removing these loops in the UGAL-L adaptive routing algorithm is shown to provide slight improvements in average latency and also allow the network to carry up to 12% more traffic before saturation.
Location Based Services (LBS) have become extremely popular over the past decade, being used on a daily basis by millions of users. Instances of real-world LBS range from mapping services (e.g., Google Maps) to lifest...
详细信息
ISBN:
(纸本)9781509065431
Location Based Services (LBS) have become extremely popular over the past decade, being used on a daily basis by millions of users. Instances of real-world LBS range from mapping services (e.g., Google Maps) to lifestyle recommendations (e.g., Yelp) to real-estate search (e.g., Redfin). In general, an LBS provides a public (often web-based) search interface over its backend database (of tuples with 2D geolocations), taking as input a 2D query point and returning k tuples in the database that are closest to the query point, where k is usually a small constant such as 20 or 50. Such a public interface is often called a k-Nearest-Neighbor, i.e., kNN, interface. In this paper, we consider a novel problem of enabling density based clustering over the backend database of an LBS using nothing but limited access to the kNN interface provided by the LBS. Specifically, a key limit enforced by most real-world LBS is a maximum number of kNN queries allowed from a user over a given time period. Since such a limit is often orders of magnitude smaller than the number of tuples in the LBS database, our goal here is to mine from the LBS a cluster assignment function f(center dot), such that for any tuple t in the database (which may or may not have been accessed), f(center dot) can produce the cluster assignment of t with high accuracy. We conduct a comprehensive set of experiments over benchmark datasets and popular real-world LBS such as Yahoo! Flickr, Zillow, Redfin and Google Maps and demonstrate the effectiveness of our proposed techniques.
暂无评论