Efficient and accurate template matching in multisource images is a difficult task when hardware platform resources are limited. Motivated by the problems encountered present methods, scheme, called Matching Pixel Distribution Comparison (MPDC), proposed to reduce use of system combining traditional algorithms neural networks. The MPDC scheme first extracts distribution information image pixels...

background: radial movement of the arterial wall is a well-known indicator of the mechanical properties of arteries in arterial disease examinations. in the present study, two different motion estimation methods, based on the block-matching and maximum-gradient algorithms, were examined to extract the radial displacement of the carotid artery wall. methods: each program was separately implement...

Deep Entity Matching (EM) is one of the core research topics in data integration. Typical existing works construct EM models by training deep neural networks (DNNs) based on samples with onehot labels. However, these sharp supervision signals labels harm generalization models, causing them to overfit and perform badly unseen datasets. To solve this problem, we first propose that challenge a wel...

computation of the second order delay in rc-tree based circuits is important during the design process of modern vlsi systems with respect to having tree structure circuits. calculation of the second and higher order moments is possible in tree based networks. because of the closed form solution, computation speed and the ease of using the performance optimization in vlsi design methods such as...

It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...

The proposed algorithm suggests a new method for determination of K/S value of primaries based on linear least Squares Technique. By applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant Kubelka-Munk theory. The selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...

The proposed algorithm suggests a new method for determination of K/S value of primaries based on linear least Squares Technique. By applying the matrix pseudoinverse, a modification is introduced to eliminate the limitation on the numbers of applied dyes in one – constant Kubelka-Munk theory. The selection of dyes for tristimulus matching are also done on the basis of the initial spectrophotom...