Abstract: The reconstruction from sparse-view projections is one
of important problems in computed tomography (CT) limited by
the availability or feasibility of obtaining of a large number of
projections. Traditionally, convex regularizers have been exploited
to improve the reconstruction quality in sparse-view CT, and the
convex constraint in those problems leads to an easy optimization
process. However, convex regularizers often result in a biased
approximation and inaccurate reconstruction in CT problems. Here,
we present a nonconvex, Lipschitz continuous and non-smooth
regularization model. The CT reconstruction is formulated as a
nonconvex constrained L1 − L2 minimization problem and solved
through a difference of convex algorithm and alternating direction
of multiplier method which generates a better result than L0 or L1
regularizers in the CT reconstruction. We compare our method with
previously reported high performance methods which use convex
regularizers such as TV, wavelet, curvelet, and curvelet+TV (CTV)
on the test phantom images. The results show that there are benefits in
using the nonconvex regularizer in the sparse-view CT reconstruction.
Abstract: This paper presents feature level image fusion using Haar lifting wavelet transform. Feature fused is edge and boundary information, which is obtained using wavelet transform modulus maxima criteria. Simulation results show the superiority of the result as entropy, gradient, standard deviation are increased for fused image as compared to input images. The proposed methods have the advantages of simplicity of implementation, fast algorithm, perfect reconstruction, and reduced computational complexity. (Computational cost of Haar wavelet is very small as compared to other lifting wavelets.)
Abstract: Recently, the Field Programmable Gate Array (FPGA) technology offers the potential of designing high performance systems at low cost. The discrete wavelet transform has gained the reputation of being a very effective signal analysis tool for many practical applications. However, due to its computation-intensive nature, current implementation of the transform falls short of meeting real-time processing requirements of most application. The objectives of this paper are implement the Haar and Daubechies wavelets using FPGA technology. In addition, the Bit Error Rate (BER) between the input audio signal and the reconstructed output signal for each wavelet is calculated. From the BER, it is seen that the implementations execute the operation of the wavelet transform correctly and satisfying the perfect reconstruction conditions. The design procedure has been explained and designed using the stat-ofart Electronic Design Automation (EDA) tools for system design on FPGA. Simulation, synthesis and implementation on the FPGA target technology has been carried out.
Abstract: In this work, a special case of the image superresolution
problem where the only type of motion is global
translational motion and the blurs are shift-invariant is investigated.
The necessary conditions for exact reconstruction of the original
image by using finite impulse-response reconstruction filters are
developed. Given that the conditions are satisfied, a method for exact
super-resolution is presented and some simulation results are shown.
Abstract: A new estimator for evolutionary spectrum (ES) based
on short time Fourier transform (STFT) and modified group delay
function (MGDF) by signal decomposition (SD) is proposed. The
STFT due to its built-in averaging, suppresses the cross terms and the
MGDF preserves the frequency resolution of the rectangular window
with the reduction in the Gibbs ripple. The present work overcomes
the magnitude distortion observed in multi-component non-stationary
signals with STFT and MGDF estimation of ES using SD. The SD is
achieved either through discrete cosine transform based harmonic
wavelet transform (DCTHWT) or perfect reconstruction filter banks
(PRFB). The MGDF also improves the signal to noise ratio by
removing associated noise. The performance of the present method is
illustrated for cross chirp and frequency shift keying (FSK) signals,
which indicates that its performance is better than STFT-MGDF
(STFT-GD) alone. Further its noise immunity is better than STFT.
The SD based methods, however cannot bring out the frequency
transition path from band to band clearly, as there will be gap in the
contour plot at the transition. The PRFB based STFT-SD shows good
performance than DCTHWT decomposition method for STFT-GD.
Abstract: Most CT reconstruction system x-ray computed
tomography (CT) is a well established visualization technique in
medicine and nondestructive testing. However, since CT scanning
requires sampling of radiographic projections from different viewing
angles, common CT systems with mechanically moving parts are too
slow for dynamic imaging, for instance of multiphase flows or live
animals. A large number of X-ray projections are needed to
reconstruct CT images, so the collection and calculation of the
projection data consume too much time and harmful for patient. For
the purpose of solving the problem, in this study, we proposed a
method for tomographic reconstruction of a sample from a limited
number of x-ray projections by using linear interpolation method. In
simulation, we presented reconstruction from an experimental x-ray
CT scan of a Aluminum phantom that follows to two steps: X-ray
projections will be interpolated using linear interpolation method and
using it for CT reconstruction based upon Ordered Subsets
Expectation Maximization (OSEM) method.
Abstract: For the communication between human and computer
in an interactive computing environment, the gesture recognition is
studied vigorously. Therefore, a lot of studies have proposed efficient
methods about the recognition algorithm using 2D camera captured
images. However, there is a limitation to these methods, such as the
extracted features cannot fully represent the object in real world.
Although many studies used 3D features instead of 2D features for
more accurate gesture recognition, the problem, such as the processing
time to generate 3D objects, is still unsolved in related researches.
Therefore we propose a method to extract the 3D features combined
with the 3D object reconstruction. This method uses the modified
GPU-based visual hull generation algorithm which disables unnecessary
processes, such as the texture calculation to generate three kinds
of 3D projection maps as the 3D feature: a nearest boundary, a farthest
boundary, and a thickness of the object projected on the base-plane. In
the section of experimental results, we present results of proposed
method on eight human postures: T shape, both hands up, right hand
up, left hand up, hands front, stand, sit and bend, and compare the
computational time of the proposed method with that of the previous
methods.
Abstract: In this paper, various algorithms for designing quadrature mirror filter are reviewed and a new algorithm is presented for the design of near perfect reconstruction quadrature mirror filter bank. In the proposed algorithm, objective function is formulated using the perfect reconstruction condition or magnitude response condition of prototype filter at frequency (ω = 0.5π) in ideal condition. The cutoff frequency is iteratively changed to adjust the filters coefficients using optimization algorithm. The performances of the proposed algorithm are evaluated in term of computation time, reconstruction error and number of iterations. The design examples illustrate that the proposed algorithm is superior in term of peak reconstruction error, computation time, and number of iterations. The proposed algorithm is simple, easy to implement, and linear in nature.
Abstract: This paper proposes an efficient method for the design
of two channel quadrature mirror filter (QMF) bank. To achieve
minimum value of reconstruction error near to perfect reconstruction,
a linear optimization process has been proposed. Prototype low pass
filter has been designed using Kaiser window function. The modified
algorithm has been developed to optimize the reconstruction error
using linear objective function through iteration method. The result
obtained, show that the performance of the proposed algorithm is
better than that of the already exists methods.
Abstract: The tree structured approach of non-uniform filterbank
(NUFB) is normally used in perfect reconstruction (PR). The PR is
not always feasible due to certain limitations, i.e, constraints in
selecting design parameters, design complexity and some times
output is severely affected by aliasing error if necessary and
sufficient conditions of PR is not satisfied perfectly. Therefore, there
has been generalized interest of researchers to go for near perfect
reconstruction (NPR). In this proposed work, an optimized tree
structure technique is used for the design of NPR non-uniform
filterbank. Window functions of Blackman family are used to design
the prototype FIR filter. A single variable linear optimization is used
to minimize the amplitude distortion. The main feature of the
proposed design is its simplicity with linear phase property.