The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents our study on image reconstruction algorithms for THz near field scanning systems. Based on the principle of Physical Optics (PO) algorithm, we have proposed and investigated a novel transposed convolution image reconstruction algorithm (TC), in comparison with the back propagation algorithm (BP) in simulation and experiment.
We study tiled algorithms for going from a "full" matrix to a condensed "band bidiagonal" form using orthog-onal transformations: (i) the tiled bidiagonalization algorithm BIDIAG, which is a tiled version of the standard scalar bidiago-nalization algorithm; and (ii) the R-bidiagonalization algorithm R-BIDIAG, which is a tiled version of the algorithm which consists in first performing...
Compiler optimizations discover facts about program behavior by querying static analysis. However, developing or extending precise analysis is difficult. Some prior works implement analysis with a single algorithm, but the algorithm becomes more complex as it is extended for greater precision. Other works achieve modularity by implementing several simple algorithms and trivially composing them to...
The idea of localization, e.g., mating restriction, local search, is often employed in the design of evolutionary multi-objective algorithms, and has been demonstrated effective in many studies. This paper proposes a localized penalty boundary intersection (PBI) method which is then used in the seminal decomposition based algorithm, i.e., MOEA/D. The localized PBI (LPBI) method works in a pre-defined...
Distance-based and density-based clustering algorithmsare often used on large spatial and arbitrary shape ofdata sets. However, some well-known clustering algorithms havetroubles when distribution of objects in the dataset varies, andthis may lead to a bad clustering result. Such bad performancesare more dramatically significant on high-dimensional dataset. Recently, Rodriguez and Laio proposed an...
In this paper we propose a novel algorithm for a decomposition of 3D binary shapes to rectangular blocks. The aim is to minimize the number of blocks. Theoretically optimal brute-force algorithm is known to be NP-hard and practically infeasible. We introduce its polynomial sub-optimal approximation, which transforms the decomposition problem onto a graph-theoretical problem. We show by extensive experiments...
In this paper we focus on waveform coefficient matrix (WCEM) design to perform matched beampattern design with lower sidelobe level for generalized MIMO configurations. First, the relationship between transmit waveforms and beam-pattern, and the limitation of conventional waveform covariance matrix (WCVM) design are briefly discussed. Then a power approximation method (PAM) by minimizing both integrated...
Trajectory simplification is a problem encountered in areas like Robot programming by demonstration, CAD/CAM, computer vision, and in GPS-based applications like traffic analysis. This problem entails reduction of the points in a given trajectory while keeping the relevant points which preserve important information. The benefits include storage reduction, computational expense, while making data...
This paper describes the first 'image beacon' system that is capable of broadcasting binary images over a very long period (years, as opposed to days or weeks) using a set of cheap, low-power, memory-constrained Bluetooth Low Energy (BLE) beacon devices. We design a patch-based image encoding algorithm to produce encoded images of reasonably high quality, having sizes of as low as 16 bytes -- without...
This work improves algorithms for finding network flows both sustainable and robust against multilink-attack (MLA). It brings out the relationship between sustainability (flow solution before attack known as MLA-reliable flow) and robustness (flow value after attack known as MLA-robust flow). Both problems are known to be NP-hard. However, exact polynomial time algorithms exist for certain categories...
In this paper, we present a method to plan grasps for soft hands. Considering that soft hands can easily conform to the shape an the object, with preference to certain types of basic geometries and dimensions, we decompose the object into one type of these geometries, particularly into Minimal Volume Bounding Boxes (MVBBs), which are proved to be efficiently graspable by the hand we use. A set of...
There are several methods used to construct curves in CAGD, e.g., the de Casteljaus algorithm, DP algorithm, and NB1 algorithm. However, they are represented in the forms that are not suitable for performing geometric modeling. A proposed approach for evaluating DP curve, NB1 Curve by using monomial form was introduced by Aphirukmatakun and Dejdumrong in 2009. The authors did not provide any proofs...
With the knowledge of locations of each node in randomly deployed wireless sensor networks, the detection of coverage holes is researched in this paper. An improved hole detection algorithm is proposed based on the Boolean sensing model. The algorithm screens out hole-boundary nodes by Voronoi Diagram. In order to achieve location information of coverage holes, we introduce a new method called Virtual...
Topological persistence measures the resilience of extrema of a function to perturbations, and has received increasing attention in computer graphics, visualization and computer vision. While the notion of topological persistence for piece-wise linear functions defined on a simplicial complex has been well studied, the time complexity of all the known algorithms are super-linear (e.g. O(n log n))...
The shape reconstruction problem is one of important and most applied problems in many branches of computer science. In this paper a new method is introduced which a graph as output and work on boundary samples as input, in the plan. The proposed method starts reconstruction from the random polygon production on input points and by calculating the Euclidean distance between points, it produces a set...
A linear-time algorithm is proposed for polygonal approximation of digital curves. The direction changes of the x- and y-coordinates are traced to generate a new, compact representation of curves. The algorithm, Direction Change-based Polygonal Approximation (DCPA), has two advantages: linear time complexity and insensitivity to parameter setting. Benchmark results demonstrate the competitive performance...
How many linear segments are sufficient to represent a shape? In this paper we consider the problem of the nonparametric polygonal and multimodel approximation of digital curves. In order to solve the problem, we propose algorithm that is based on the parameterized model of the Rate-Distortion curve and the multiplicative cost function. By analyzing the minimum of the cost function, we define a solution...
In cartography curve simplification is a recurrent problem. The purpose is to remove irrelevant details while emphasizing the main features of the curve. Decomposition of curve is preprocessing of curve simplification. Most of the current techniques belong to the spatial domain (least square method, active contour, point selection). However, some techniques applying to the frequency domain (Fourier...
Compared with the common line-simple algorithm, contour generalization pays more attention on the spatial relationship and coordination between the lines. Using the common D-P algorithm may cause intersection or self-intersection. Combined with the particularity of contours, this paper improves the Douglas-Peucker simplification algorithm from tolerance, curvature and the simplified method. The experiment...
In the last decades 3D face recognition is considered as the most promising axe of reasearch; however its amelioration with information from different resources seems to be more encouraged. Our motivation for a fusion information step is that the data issues from matchers based on different approaches can be completed and determined. Then we propose in this paper a new method of 3D facial recognition...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.