In computer vision, visual object tracking is a significant task for monitoring
applications. Tracking of object type is a matching trouble. In object tracking, one
main difficulty is to select features and build models which are convenient for
distinguishing and tracing the target. The suggested system for continuous features
descriptor and matching in video has three steps. Firstly, apply wavelet transform on
image using Haar filter. Secondly interest points were detected from wavelet image
using features from accelerated segment test (FAST) corner detection. Thirdly those
points were descripted using Speeded Up Robust Features (SURF). The algorithm
of Speeded Up Robust Features (SURF) has been employed and implemented for
object in video stream tracking and matching. The descriptor of feature in SURF can
be operated by minimizing the space of search for potential points of interest inside
the scale space image pyramid. The tracked interest points that are resulted are more
recurrence and pother free. For dealing with images that contain blurring and
rotation, SURF is best. Fast corner detector can be employed along SURF method to
build integral images .The integral images can be used to enhance the speed of
image matching. The features that are extracted from video images are matched
using Manhattan distance measure. Apply the algorithm of FAST corner detection
along SURF descriptor of feature; tracking and matching adequacy is better, fast and
more efficient than Scale Invariant Feature Transform SIFT descriptor. The
experimental outcomes displayed that the time that SURF could be taken for
matching is less than the time that SIFT could be taken ,the SURF accuracy depends
on number of key-points which are extracted from each frame. SURF key-points are
less than SIFT key-points; therefore, SURF key-points could be considered optimal
in the process of matching accuracy.
In this paper, an efficient image segmentation scheme is proposed of boundary based & geometric region features as an alternative way of utilizing statistical base only. The test results vary according to partitioning control parameters values and image details or characteristics, with preserving the segmented image edges.
Recently digital mammography is most widely used technology for early detection of breast cancer. The main diagnosing elements such as lesion or masses in digital mammograms are with law contrast. The purpose of this paper is to enhance the mammogram images by increasing its contrast. Different enhancement method are used for this purpose such as histogram equalization (HE), Contrast Limited Adaptive Histogram Equalization (CLAHE), Morphological, and Retinex. The Retinex method also implement by combining it with HE once, and with CLAHE to improve its performance. The experimental results show that using Retinex with CLAHE can produce an image with enhancement in contrast better than using it with HE method and better than other methods
... Show MoreIn this paper, a simple medical image compression technique is proposed, that based on utilizing the residual of autoregressive model (AR) along with bit-plane slicing (BPS) to exploit the spatial redundancy efficiently. The results showed that the compression performance of the proposed techniques is improved about twice on average compared to the traditional autoregressive, along with preserving the image quality due to considering the significant layers only of high image contribution effects.
The conjugate coefficient optimal is the very establishment of a variety of conjugate gradient methods. This paper proposes a new class coefficient of conjugate gradient (CG) methods for impulse noise removal, which is based on the quadratic model. Our proposed method ensures descent independent of the accuracy of the line search and it is globally convergent under some conditions, Numerical experiments are also presented for the impulse noise removal in images.
In this research paper, a new blind and robust fingerprint image watermarking scheme based on a combination of dual-tree complex wavelet transform (DTCWT) and discrete cosine transform (DCT) domains is demonstrated. The major concern is to afford a solution in reducing the consequence of geometric attacks. It is due to the fingerprint features that may be impacted by the incorporated watermark, fingerprint rotations, and displacements that result in multiple feature sets. To integrate the bits of the watermark sequence into a differential process, two DCT-transformed sub-vectors are implemented. The initial sub-vectors were obtained by sub-sampling in the host fingerprint image of both real and imaginary parts of the DTCWT wavelet coeffi
... Show More
(3)
(1)
LK Abood, RA Ali, M Maliki, International Journal of Science and Research, 2015 - Cited by 2
In this paper, the linear system of Fredholm integral equations is solving using Open Newton-Cotes formula, which we use five different types of Open Newton-Cotes formula to solve this system. Compare the results of suggested method with the results of another method (closed Newton-Cotes formula) Finally, at the end of each method, algorithms and programs developed and written in MATLAB (version 7.0) and we give some numerical examples, illustrate suggested method
Rate of penetration plays a vital role in field development process because the drilling operation is expensive and include the cost of equipment and materials used during the penetration of rock and efforts of the crew in order to complete the well without major problems. It’s important to finish the well as soon as possible to reduce the expenditures. So, knowing the rate of penetration in the area that is going to be drilled will help in speculation of the cost and that will lead to optimize drilling outgoings. In this research, an intelligent model was built using artificial intelligence to achieve this goal. The model was built using adaptive neuro fuzzy inference system to predict the rate of penetration in
... Show More
This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show More