Abstract: The purpose of this work is to present a method for
rigid registration of medical images using 1D binary projections
when a part of one of the two images is missing. We use 1D binary
projections and we adjust the projection limits according to the
reduced image in order to perform accurate registration. We use the
variance of the weighted ratio as a registration function which we
have shown is able to register 2D and 3D images more accurately and
robustly than mutual information methods. The function is computed
explicitly for n=5 Chebyshev points in a [-9,+9] interval and it is
approximated using Chebyshev polynomials for all other points. The
images used are MR scans of the head. We find that the method is
able to register the two images with average accuracy 0.3degrees for
rotations and 0.2 pixels for translations for a y dimension of 156 with
initial dimension 256. For y dimension 128/256 the accuracy
decreases to 0.7 degrees for rotations and 0.6 pixels for translations.
Abstract: This paper presents a comparative study of Ant Colony and Genetic Algorithms for VLSI circuit bi-partitioning. Ant colony optimization is an optimization method based on behaviour of social insects [27] whereas Genetic algorithm is an evolutionary optimization technique based on Darwinian Theory of natural evolution and its concept of survival of the fittest [19]. Both the methods are stochastic in nature and have been successfully applied to solve many Non Polynomial hard problems. Results obtained show that Genetic algorithms out perform Ant Colony optimization technique when tested on the VLSI circuit bi-partitioning problem.
Abstract: In this paper, we define distance partition of vertex set of a graph G with reference to a vertex in it and with the help of the same, a graph with metric dimension two (i.e. β (G) = 2 ) is characterized. In the process, we develop a polynomial time algorithm that verifies if the metric dimension of a given graph G is two. The same algorithm explores all metric bases of graph G whenever β (G) = 2 . We also find a bound for cardinality of any distance partite set with reference to a given vertex, when ever β (G) = 2 . Also, in a graph G with β (G) = 2 , a bound for cardinality of any distance partite set as well as a bound for number of vertices in any sub graph H of G is obtained in terms of diam H .
Abstract: In this paper a deterministic polynomial-time
algorithm is presented for the Clique problem. The case is considered
as the problem of omitting the minimum number of vertices from the
input graph so that none of the zeroes on the graph-s adjacency
matrix (except the main diagonal entries) would remain on the
adjacency matrix of the resulting subgraph. The existence of a
deterministic polynomial-time algorithm for the Clique problem, as
an NP-complete problem will prove the equality of P and NP
complexity classes.
Abstract: Given a bivariate normal sample of correlated variables,
(Xi, Yi), i = 1, . . . , n, an alternative estimator of Pearson’s correlation
coefficient is obtained in terms of the ranges, |Xi − Yi|.
An approximate confidence interval for ρX,Y is then derived, and
a simulation study reveals that the resulting coverage probabilities
are in close agreement with the set confidence levels. As well, a
new approximant is provided for the density function of R, the
sample correlation coefficient. A mixture involving the proposed
approximate density of R, denoted by hR(r), and a density function
determined from a known approximation due to R. A. Fisher is shown
to accurately approximate the distribution of R. Finally, nearly exact
density approximants are obtained on adjusting hR(r) by a 7th degree
polynomial.
Abstract: In this paper, we develop quartic nonpolynomial
spline method for the numerical solution of third order two point
boundary value problems. It is shown that the new method gives
approximations, which are better than those produced by other spline
methods. Convergence analysis of the method is discussed through
standard procedures. Two numerical examples are given to illustrate
the applicability and efficiency of the novel method.
Abstract: Nonlinear response behaviour of a cracked RC beam under harmonic excitation is analysed to investigate various instability phenomena like, bifurcation, jump phenomena etc. The nonlinearity of the system arises due to opening and closing of the cracks in the RC beam and is modelled as a cubic polynomial. In order to trace different branches at the bifurcation point on the response curve (amplitude versus frequency of excitation plot), an arc length continuation technique along with the incremental harmonic balance (IHBC) method is employed. The stability of the solution is investigated by the Floquet theory using Hsu-s scheme. The periodic solutions obtained by the IHBC method are compared with these obtained by the numerical integration of the equation of motion. Characteristics of solutions fold bifurcation, jump phenomena and from stable to unstable zones are identified.
Abstract: In this paper, a near lossless image coding scheme
based on Orthogonal Polynomials Transform (OPT) has been
presented. The polynomial operators and polynomials basis operators
are obtained from set of orthogonal polynomials functions for the
proposed transform coding. The image is partitioned into a number of
distinct square blocks and the proposed transform coding is applied to
each of these individually. After applying the proposed transform
coding, the transformed coefficients are rearranged into a sub-band
structure. The Embedded Zerotree (EZ) coding algorithm is then
employed to quantize the coefficients. The proposed transform is
implemented for various block sizes and the performance is
compared with existing Discrete Cosine Transform (DCT) transform
coding scheme.
Abstract: The flexible follower response of a translating cam with
four different profiles for rise-dwell-fall-dwell (RDFD) motion is
investigated. The cycloidal displacement motion, the modified
sinusoidal acceleration motion, the modified trapezoidal acceleration
motion, and the 3-4-5 polynomial motion are employed to describe the
rise and the fall motions of the follower and the associated four kinds of
cam profiles are studied. Since the follower flexibility is considered,
the contact point of the roller and the cam is an unknown. Two
geometric constraints formulated to restrain the unknown position are
substituted into Hamilton-s principle with Lagrange multipliers.
Applying the assumed mode method, one can obtain the governing
equations of motion as non-linear differential-algebraic equations. The
equations are solved using Runge-Kutta method. Then, the responses of
the flexible follower undergoing the four different motions are
investigated in time domain and in frequency domain.
Abstract: This paper present a new way to find the aerodynamic characteristic equation of missile for the numerical trajectories prediction more accurate. The goal is to obtain the polynomial equation based on two missile characteristic parameters, angle of attack (α ) and flight speed (╬¢ ). First, the understudied missile is modeled and used for flow computational model to compute aerodynamic force and moment. Assume that performance range of understudied missile where range -10< α
Abstract: In this paper, a system level behavioural model for RF
power amplifier, which exhibits memory effects, and based on multibranch
system is proposed. When higher order terms are included,
the memory polynomial model (MPM) exhibits numerical
instabilities. A set of memory orthogonal polynomial model
(OMPM) is introduced to alleviate the numerical instability problem
associated to MPM model. A data scaling and centring algorithm was
applied to improve the power amplifier modeling accuracy.
Simulation results prove that the numerical instability can be greatly
reduced, as well as the model precision improved with nonlinear
model.
Abstract: This paper presents the application of a signal intensity
independent similarity criterion for rigid and non-rigid body
registration of binary objects. The criterion is defined as the
weighted ratio image of two images. The ratio is computed on a
voxel per voxel basis and weighting is performed by setting the raios
between signal and background voxels to a standard high value. The
mean squared value of the weighted ratio is computed over the union
of the signal areas of the two images and it is minimized using the
Chebyshev polynomial approximation.
Abstract: In this paper, we present an innovative scheme of
blindly extracting message bits from an image distorted by an attack.
Support Vector Machine (SVM) is used to nonlinearly classify the
bits of the embedded message. Traditionally, a hard decoder is used
with the assumption that the underlying modeling of the Discrete
Cosine Transform (DCT) coefficients does not appreciably change.
In case of an attack, the distribution of the image coefficients is
heavily altered. The distribution of the sufficient statistics at the
receiving end corresponding to the antipodal signals overlap and a
simple hard decoder fails to classify them properly. We are
considering message retrieval of antipodal signal as a binary
classification problem. Machine learning techniques like SVM is
used to retrieve the message, when certain specific class of attacks is
most probable. In order to validate SVM based decoding scheme, we
have taken Gaussian noise as a test case. We generate a data set using
125 images and 25 different keys. Polynomial kernel of SVM has
achieved 100 percent accuracy on test data.
Abstract: Many multimedia communication applications require a
source to transmit messages to multiple destinations subject to quality
of service (QoS) delay constraint. To support delay constrained
multicast communications, computer networks need to guarantee an
upper bound end-to-end delay from the source node to each of
the destination nodes. This is known as multicast delay problem.
On the other hand, if the same message fails to arrive at each
destination node at the same time, there may arise inconsistency and
unfairness problem among users. This is related to multicast delayvariation
problem. The problem to find a minimum cost multicast
tree with delay and delay-variation constraints has been proven to
be NP-Complete. In this paper, we propose an efficient heuristic
algorithm, namely, Economic Delay and Delay-Variation Bounded
Multicast (EDVBM) algorithm, based on a novel heuristic function,
to construct an economic delay and delay-variation bounded multicast
tree. A noteworthy feature of this algorithm is that it has very high
probability of finding the optimal solution in polynomial time with
low computational complexity.
Abstract: Global approximation using metamodel for complex
mathematical function or computer model over a large variable
domain is often needed in sensibility analysis, computer simulation,
optimal control, and global design optimization of complex, multiphysics
systems. To overcome the limitations of the existing
response surface (RS), surrogate or metamodel modeling methods for
complex models over large variable domain, a new adaptive and
regressive RS modeling method using quadratic functions and local
area model improvement schemes is introduced. The method applies
an iterative and Latin hypercube sampling based RS update process,
divides the entire domain of design variables into multiple cells,
identifies rougher cells with large modeling error, and further divides
these cells along the roughest dimension direction. A small number
of additional sampling points from the original, expensive model are
added over the small and isolated rough cells to improve the RS
model locally until the model accuracy criteria are satisfied. The
method then combines local RS cells to regenerate the global RS
model with satisfactory accuracy. An effective RS cells sorting
algorithm is also introduced to improve the efficiency of model
evaluation. Benchmark tests are presented and use of the new
metamodeling method to replace complex hybrid electrical vehicle
powertrain performance model in vehicle design optimization and
optimal control are discussed.
Abstract: This paper proves that the problem of finding connected
vertex cover in a 2-connected planar graph ( CVC-2 ) with maximum degree 4 is NP-complete. The motivation for proving this result is to
give a shorter and simpler proof of NP-Completeness of TRA-MLC (the Top Right Access point Minimum-Length Corridor) problem [1], by finding the reduction from CVC-2. TRA-MLC has many applications in laying optical fibre cables for data communication and electrical wiring in floor plans.The problem of finding connected vertex cover in any planar graph ( CVC ) with maximum degree 4 is NP-complete [2]. We first show that CVC-2 belongs to NP and then we find a polynomial reduction from CVC to CVC-2. Let a graph G0 and an integer K form an instance of CVC, where G0 is a planar graph and K is an upper bound on the size of the connected vertex cover in G0. We construct a 2-connected planar graph, say G, by identifying the blocks and cut vertices of G0, and then finding the planar representation of all the blocks of G0, leading to a plane graph G1. We replace the cut vertices with cycles in such a way that the resultant graph G is a 2-connected planar graph with maximum
degree 4. We consider L = K -2t+3 t i=1 di where t is the number of cut vertices in G1 and di is the number of blocks for which ith cut vertex is common. We prove that G will have a connected vertex
cover with size less than or equal to L if and only if G0 has a connected vertex cover of size less than or equal to K.
Abstract: A numerical method for solving nonlinear Fredholm integral equations of second kind is proposed. The Fredholm type equations which have many applications in mathematical physics are then considered. The method is based on hybrid function approximations. The properties of hybrid of block-pulse functions and Chebyshev polynomials are presented and are utilized to reduce the computation of nonlinear Fredholm integral equations to a system of nonlinear. Some numerical examples are selected to illustrate the effectiveness and simplicity of the method.
Abstract: Over the past several years, there has been a
considerable amount of research within the field of Quality of
Service (QoS) support for distributed multimedia systems. One of the
key issues in providing end-to-end QoS guarantees in packet
networks is determining a feasible path that satisfies a number of
QoS constraints. The problem of finding a feasible path is NPComplete
if number of constraints is more than two and cannot be
exactly solved in polynomial time. We proposed Feasible Path
Selection Algorithm (FPSA) that addresses issues with pertain to
finding a feasible path subject to delay and cost constraints and it
offers higher success rate in finding feasible paths.
Abstract: In this paper, we propose an easily computable proximity index for predicting voltage collapse of a load bus using only measured values of the bus voltage and power; Using these measurements a polynomial of fourth order is obtained by using LES estimation algorithms. The sum of the absolute values of the polynomial coefficient gives an idea of the critical bus. We demonstrate the applicability of our proposed method on 6 bus test system. The results obtained verify its applicability, as well as its accuracy and the simplicity. From this indicator, it is allowed to predict the voltage instability or the proximity of a collapse. Results obtained by the PV curve are compared with corresponding values by QV curves and are observed to be in close agreement.
Abstract: In this paper we consider a nonlinear control design for
nonlinear systems by using two-stage formal linearization and twotype
LQ controls. The ordinary LQ control is designed on almost
linear region around the steady state point. On the other region,
another control is derived as follows. This derivation is based on
coordinate transformation twice with respect to linearization functions
which are defined by polynomials. The linearized systems can be
made up by using Taylor expansion considered up to the higher order.
To the resulting formal linear system, the LQ control theory is applied
to obtain another LQ control. Finally these two-type LQ controls
are smoothly united to form a single nonlinear control. Numerical
experiments indicate that this control show remarkable performances
for a nonlinear system.