This paper briefly surveys the recent progress on visual perception algorithms and their corresponding hardware implementations for the emerging application of autonomous driving. In particular, vehicle and pedestrian...
详细信息
This paper briefly surveys the recent progress on visual perception algorithms and their corresponding hardware implementations for the emerging application of autonomous driving. In particular, vehicle and pedestrian detection, lane detection and drivable surface detection are presented as three important applications for visual perception. On the other hand, CPU, GPU, FPGA and ASIC are discussed as the major components to form an efficient hardware platform for real-time operation. Finally, several technical challenges are presented to motivate future research and development in the field.
The problems of finding minimum-cost and maximum-cost sets of edge-disjoint cycles in a weighted undirected graph are studied. The importance of this problem is that it presents a 'middle station' in two reduc...
详细信息
The problems of finding minimum-cost and maximum-cost sets of edge-disjoint cycles in a weighted undirected graph are studied. The importance of this problem is that it presents a 'middle station' in two reductions for planar graphs - one between the max-cut problem and that of max-weight matching, and the other between the Chinese Postman Problem and max-weight matching. The introduction of negative edge costs makes the reductions simple and efficient. We obtain new simpler algorithms for these two problems for planar graphs (where the max-weight matching problem can be solved very efficiently). We conclude that, in the case of planar weighted graphs (with arbitrary costs), all the three problems are mutually reducible and equivalent in terms of complexity.
Establishing the neighbor list to efficiently calculate the inter-atomic forces consumes the majority of computation time in molecular dynamics (MD) simulation. Several algorithms have been proposed to improve the com...
详细信息
Establishing the neighbor list to efficiently calculate the inter-atomic forces consumes the majority of computation time in molecular dynamics (MD) simulation. Several algorithms have been proposed to improve the computation efficiency for short-range interaction in recent years, although an optimized numerical algorithm has not been provided. Based on a rigorous definition of Verlet radius with respect to temperature and list-updating interval in MD simulation, this paper has successfully developed an estimation formula of the computation time for each MD algorithm calculation so as to find an optimized performance for each algorithm. With the formula proposed here, the best algorithm can be chosen based on different total number of atoms, system average density and system average temperature for the MD simulation. It has been shown that the Verlet Cell-linked List (VCL) algorithm is better than other algorithms for a system with a large number of atoms. Furthermore, a generalized VCL algorithm optimized with a list-updating interval and cell-dividing number is analyzed and has been verified to reduce the computation time by 30 similar to 60% in a MD simulation for a two-dimensional lattice system. Due to similarity, the analysis in this study can be extended to other many-particle systems. (C) 2007 Elsevier B.V. All rights reserved.
The paper describes a searching algorithm, based on the routh array, to determine the unknown coefficients of a Hurwitz polynomial ABAR(S) of degree n, where polynomial P(S) of degree m - 1(m - 1 < n) is given and ...
详细信息
The paper describes a searching algorithm, based on the routh array, to determine the unknown coefficients of a Hurwitz polynomial ABAR(S) of degree n, where polynomial P(S) of degree m - 1(m - 1 < n) is given and determines the first m coefficients. Sufficient conditions are derived to ensure that no solution exists, and a criterion of failure of the search is also derived and is shown to be both necessary and sufficient. Some examples are given, and it is demonstrated that increasing the number of restrictions on the ranges of the search increases the speed of solution and the number of solutions found. It is also shown that increasing the number of trials (N(p)) increases the time taken and the number of solutions found. The examples illustrate how the given polynomial P(S) restricts the range of values of the unknown coefficients and how, in particular, this may lead to a need for very large or very small gains for implementation of state variable feedback.
The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect t...
详细信息
The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations and the renaming of dummy indices. The tensor indices are split into classes and a natural place for them is defined. The canonical form is the closest configuration to the natural configuration. In the second part, the Grobner basis method is used to simplify tensor expressions which obey the linear identities that come from cyclic symmetries (or more general tensor identities, including nonlinear identities). The algorithm is suitable for implementation in general purpose computer algebra systems. Some timings of an experimental implementation over the Riemann package are shown. (C) 1998 Published by Elsevier Science B.V.
Let G = (V, E) be a graph. A double Roman dominating function (DRDF) of G is a function f : V -> {0, 1, 2, 3} such that (i) each vertex v with f (v) = 0 is adjacent to either a vertex u with f (u) = 3 or two vertic...
详细信息
Let G = (V, E) be a graph. A double Roman dominating function (DRDF) of G is a function f : V -> {0, 1, 2, 3} such that (i) each vertex v with f (v) = 0 is adjacent to either a vertex u with f (u) = 3 or two vertices u1 and u2 with f (u1) = f (u2) = 2, and (ii) each vertex v with f (v) =1 is adjacent to a vertex u with f (u) > 1. The double Roman domination number of G is the minimum weight of a DRDF along all DRDFs on G, where the weight of a DRDF f on G is f (V ) = Ev is an element of V f (v). In this paper, we first propose an algorithm to compute the double Roman domination number of an interval graph G = (V, E) in O(| V | + |E|) time, answering a problem posed in Banerjee et al. (2020) [2]. Next, we show that the decision problem associated with the double Roman domination is NP-complete for split graphs. Finally, we show that the computational complexities of the Roman domination problem and the double Roman domination problem are different. (c) 2022 Elsevier B.V. All rights reserved.
Chandrasekaran's algorithm for solving the linear complementarity problem with a Z-matrix is extended to solve the Generalized Linear Complementarity Problem (GLCP) when the matrix is a vertical block Z-matrix of ...
详细信息
Chandrasekaran's algorithm for solving the linear complementarity problem with a Z-matrix is extended to solve the Generalized Linear Complementarity Problem (GLCP) when the matrix is a vertical block Z-matrix of type (m(1),..., m(n)). The extended scheme solves the GLCP in at most n cycles by either finding a solution or declaring that none exists. Numerical examples are given to demonstrate the effectiveness of the algorithm.
This paper describes an algorithm to calculate a large number of roots of the cross-product of Bessel functions and of their first derivatives. The algorithm initially finds the roots of the zeroth order using an auxi...
详细信息
This paper describes an algorithm to calculate a large number of roots of the cross-product of Bessel functions and of their first derivatives. The algorithm initially finds the roots of the zeroth order using an auxiliary function that exhibits the same roots as the original cross-products but with better behavior for numerical root search with the Newton-Raphson algorithm. In order to find the roots for higher orders, the algorithm follows a pyramidal scheme using the interlacing property of the cross-product of Bessel functions. The algorithm shows globally convergent behavior for a large range of values of the argument and of the order of the Bessel functions. The roots can be computed to any precision, limited only by the computer implementation, and the convergence is attained in six iterations per root in average, showing a much better performance than previous works for the calculation of these roots.
The margin rank of a fuzzy matrix can be estimated from the root of the function whose value is given as the least determinant of 2M matrices where M is the number of fuzzy elements contained in the fuzzy matrix. In t...
详细信息
The margin rank of a fuzzy matrix can be estimated from the root of the function whose value is given as the least determinant of 2M matrices where M is the number of fuzzy elements contained in the fuzzy matrix. In this paper an algorithm is proposed for finding the root. This algorithm requires the calculation of 2M determinants only for the verification of the root. Without this type of calculation, lower and upper bounds for the root are obtained from the minimal matrix and the interval arithmetic, respectively. The outlines of the procedures are shown in a Nassi-Shneiderman chart.
An aerosol retrieval algorithm for the first Geostationary Ocean Color Imager (GOCI) to be launched in March 2010 onboard the Communication, Ocean, and Meteorological Satellite (COMS) is presented. The algorithm retri...
详细信息
An aerosol retrieval algorithm for the first Geostationary Ocean Color Imager (GOCI) to be launched in March 2010 onboard the Communication, Ocean, and Meteorological Satellite (COMS) is presented. The algorithm retrieves aerosol optical depth (AOD), fine-mode fraction (FMIF), and aerosol type in 500 m x 500 m resolution. All the products are retrieved over clear water which is defined by surface reflectance ratio between 640 nm and 860 nm (SRR) less or equal to 2.5, while only AOD is retrieved over turbid water (SRR>2.5) due to high surface reflectance. To develop optimized algorithm for the target area of GOCI, optical properties of aerosol are analyzed from extensive observation of AERONET sunphotometers to generate lookup table. Surface reflectance of turbid water is determined from 30-day composite of Rayleigh- and gas corrected reflectance. By applying the present algorithm to MODIS top-of-the atmosphere reflectance, three different aerosol cases dominated by anthropogenic aerosol contains black carbon (BC), dust, and non-absorbing aerosol are analyzed to test the algorithm. The algorithm retrieves AOD, and size information together with aerosol type which are consistent with results inferred by RGB image in a qualitative way. The comparison of the retrieved AOD with those of MODIS collection 5 and AERONET sunphotometer observations shows reliable results. Especially, the application of turbid water algorithm significantly increases the accuracy in retrieving AOD at Anmyon station. The sensitivity study between MODIS and GOCI instruments in terms of relative sensitivity and scattering angle shows promising applicability of the present algorithm to future GOCI measurements. (C) 2010 Elsevier Inc. All rights reserved.
暂无评论