Abstract: Edge is variation of brightness in an image. Edge
detection is useful in many application areas such as finding forests,
rivers from a satellite image, detecting broken bone in a medical
image etc. The paper discusses about finding edge of multiple aerial
images in parallel. The proposed work tested on 38 images 37
colored and one monochrome image. The time taken to process N
images in parallel is equivalent to time taken to process 1 image in
sequential. Message Passing Interface (MPI) and Open Computing
Language (OpenCL) is used to achieve task and pixel level
parallelism respectively.
Abstract: In this paper we propose a novel methodology for
extracting a road network and its nodes from satellite images of
Algeria country.
This developed technique is a progress of our previous research
works. It is founded on the information theory and the mathematical
morphology; the information theory and the mathematical
morphology are combined together to extract and link the road
segments to form a road network and its nodes.
We therefore have to define objects as sets of pixels and to study
the shape of these objects and the relations that exist between them.
In this approach, geometric and radiometric features of roads are
integrated by a cost function and a set of selected points of a crossing
road. Its performances were tested on satellite images of Algeria
country.
Abstract: This paper presents the development of a robot car
that can track the motion of an object by detecting its color through
an Android device. The employed computer vision algorithm uses the
OpenCV library, which is embedded into an Android application of a
smartphone, for manipulating the captured image of the object. The
captured image of the object is subjected to color conversion and is
transformed to a binary image for further processing after color
filtering. The desired object is clearly determined after removing
pixel noise by applying image morphology operations and contour
definition. Finally, the area and the center of the object are
determined so that object’s motion to be tracked. The smartphone
application has been placed on a robot car and transmits by Bluetooth
to an Arduino assembly the motion directives so that to follow
objects of a specified color. The experimental evaluation of the
proposed algorithm shows reliable color detection and smooth
tracking characteristics.
Abstract: Image compression based on fractal coding is a lossy
compression method and normally used for gray level images range
and domain blocks in rectangular shape. Fractal based digital image
compression technique provide a large compression ratio and in this
paper, it is proposed using YUV colour space and the fractal theory
which is based on iterated transformation. Fractal geometry is mainly
applied in the current study towards colour image compression
coding. These colour images possesses correlations among the colour
components and hence high compression ratio can be achieved by
exploiting all these redundancies. The proposed method utilises the
self-similarity in the colour image as well as the cross-correlations
between them. Experimental results show that the greater
compression ratio can be achieved with large domain blocks but more
trade off in image quality is good to acceptable at less than 1 bit per
pixel.
Abstract: The detection of moving objects from a video image
sequences is very important for object tracking, activity recognition,
and behavior understanding in video surveillance.
The most used approach for moving objects detection / tracking is
background subtraction algorithms. Many approaches have been
suggested for background subtraction. But, these are illumination
change sensitive and the solutions proposed to bypass this problem
are time consuming.
In this paper, we propose a robust yet computationally efficient
background subtraction approach and, mainly, focus on the ability to
detect moving objects on dynamic scenes, for possible applications in
complex and restricted access areas monitoring, where moving and
motionless persons must be reliably detected. It consists of three
main phases, establishing illumination changes invariance,
background/foreground modeling and morphological analysis for
noise removing.
We handle illumination changes using Contrast Limited Histogram
Equalization (CLAHE), which limits the intensity of each pixel to
user determined maximum. Thus, it mitigates the degradation due to
scene illumination changes and improves the visibility of the video
signal. Initially, the background and foreground images are extracted
from the video sequence. Then, the background and foreground
images are separately enhanced by applying CLAHE.
In order to form multi-modal backgrounds we model each channel
of a pixel as a mixture of K Gaussians (K=5) using Gaussian Mixture
Model (GMM). Finally, we post process the resulting binary
foreground mask using morphological erosion and dilation
transformations to remove possible noise.
For experimental test, we used a standard dataset to challenge the
efficiency and accuracy of the proposed method on a diverse set of
dynamic scenes.
Abstract: The ultrasound imaging is very popular to diagnosis
the disease because of its non-invasive nature. The ultrasound
imaging slowly produces low quality images due to the presence of
spackle noise and wave interferences. There are several algorithms to
be proposed for the segmentation of ultrasound carotid artery images
but it requires a certain limit of user interaction. The pixel in an
image is highly correlated so the spatial information of surrounding
pixels may be considered in the process of image segmentation which
improves the results further. When data is highly correlated, one pixel
may belong to more than one cluster with different degree of
membership. There is an important step to computerize the evaluation
of arterial disease severity using segmentation of carotid artery lumen
in 2D and 3D ultrasonography and in finding vulnerable
atherosclerotic plaques susceptible to rupture which can cause stroke.
Abstract: The goal of image segmentation is to cluster pixels
into salient image regions. Segmentation could be used for object
recognition, occlusion boundary estimation within motion or stereo
systems, image compression, image editing, or image database lookup.
In this paper, we present a color image segmentation using
support vector machine (SVM) pixel classification. Firstly, the pixel
level color and texture features of the image are extracted and they
are used as input to the SVM classifier. These features are extracted
using the homogeneity model and Gabor Filter. With the extracted
pixel level features, the SVM Classifier is trained by using FCM
(Fuzzy C-Means).The image segmentation takes the advantage of
both the pixel level information of the image and also the ability of
the SVM Classifier. The Experiments show that the proposed method
has a very good segmentation result and a better efficiency, increases
the quality of the image segmentation compared with the other
segmentation methods proposed in the literature.
Abstract: Modelling of the earth's surface and evaluation of
urban environment, with 3D models, is an important research topic.
New stereo capabilities of high resolution optical satellites images,
such as the tri-stereo mode of Pleiades, combined with new image
matching algorithms, are now available and can be applied in urban
area analysis. In addition, photogrammetry software packages gained
new, more efficient matching algorithms, such as SGM, as well as
improved filters to deal with shadow areas, can achieve more dense
and more precise results.
This paper describes a comparison between 3D data extracted
from tri-stereo and dual stereo satellite images, combined with pixel
based matching and Wallis filter. The aim was to improve the
accuracy of 3D models especially in urban areas, in order to assess if
satellite images are appropriate for a rapid evaluation of urban
environments.
The results showed that 3D models achieved by Pleiades tri-stereo
outperformed, both in terms of accuracy and detail, the result
obtained from a Geo-eye pair. The assessment was made with
reference digital surface models derived from high resolution aerial
photography. This could mean that tri-stereo images can be
successfully used for the proposed urban change analyses.
Abstract: Leukaemia is a blood cancer disease that contributes
to the increment of mortality rate in Malaysia each year. There are
two main categories for leukaemia, which are acute and chronic
leukaemia. The production and development of acute leukaemia cells
occurs rapidly and uncontrollable. Therefore, if the identification of
acute leukaemia cells could be done fast and effectively, proper
treatment and medicine could be delivered. Due to the requirement of
prompt and accurate diagnosis of leukaemia, the current study has
proposed unsupervised pixel segmentation based on clustering
algorithm in order to obtain a fully segmented abnormal white blood
cell (blast) in acute leukaemia image. In order to obtain the
segmented blast, the current study proposed three clustering
algorithms which are k-means, fuzzy c-means and moving k-means
algorithms have been applied on the saturation component image.
Then, median filter and seeded region growing area extraction
algorithms have been applied, to smooth the region of segmented
blast and to remove the large unwanted regions from the image,
respectively. Comparisons among the three clustering algorithms are
made in order to measure the performance of each clustering
algorithm on segmenting the blast area. Based on the good sensitivity
value that has been obtained, the results indicate that moving kmeans
clustering algorithm has successfully produced the fully
segmented blast region in acute leukaemia image. Hence, indicating
that the resultant images could be helpful to haematologists for
further analysis of acute leukaemia.
Abstract: The Simulation based VLSI Implementation of
FELICS (Fast Efficient Lossless Image Compression System)
Algorithm is proposed to provide the lossless image compression and
is implemented in simulation oriented VLSI (Very Large Scale
Integrated). To analysis the performance of Lossless image
compression and to reduce the image without losing image quality
and then implemented in VLSI based FELICS algorithm. In FELICS
algorithm, which consists of simplified adjusted binary code for
Image compression and these compression image is converted in
pixel and then implemented in VLSI domain. This parameter is used
to achieve high processing speed and minimize the area and power.
The simplified adjusted binary code reduces the number of arithmetic
operation and achieved high processing speed. The color difference
preprocessing is also proposed to improve coding efficiency with
simple arithmetic operation. Although VLSI based FELICS
Algorithm provides effective solution for hardware architecture
design for regular pipelining data flow parallelism with four stages.
With two level parallelisms, consecutive pixels can be classified into
even and odd samples and the individual hardware engine is
dedicated for each one. This method can be further enhanced by
multilevel parallelisms.
Abstract: In this paper, we present a robust algorithm to recognize extracted text from grocery product images captured by mobile phone cameras. Recognition of such text is challenging since text in grocery product images varies in its size, orientation,
style, illumination, and can suffer from perspective distortion.
Pre-processing is performed to make the characters scale and
rotation invariant. Since text degradations can not be appropriately
defined using well-known geometric transformations such
as translation, rotation, affine transformation and shearing, we
use the whole character black pixels as our feature vector.
Classification is performed with minimum distance classifier
using the maximum likelihood criterion, which delivers very
promising Character Recognition Rate (CRR) of 89%. We
achieve considerably higher Word Recognition Rate (WRR) of
99% when using lower level linguistic knowledge about product
words during the recognition process.
Abstract: Steganography is the art and science that hides the information in an appropriate cover carrier like image, text, audio and video media. In this work the authors propose a new image based steganographic method for hiding information within the complex bit planes of the image. After slicing into bit planes the cover image is analyzed to extract the most complex planes in decreasing order based on their bit plane complexity. The complexity function next determines the complex noisy blocks of the chosen bit plane and finally pixel mapping method (PMM) has been used to embed secret bits into those regions of the bit plane. The novel approach of using pixel mapping method (PMM) in bit plane domain adaptively embeds data on most complex regions of image, provides high embedding capacity, better imperceptibility and resistance to steganalysis attack.
Abstract: The Quad Tree Decomposition based performance
analysis of compressed image data communication for lossy and
lossless through wireless sensor network is presented. Images have
considerably higher storage requirement than text. While transmitting
a multimedia content there is chance of the packets being dropped
due to noise and interference. At the receiver end the packets that
carry valuable information might be damaged or lost due to noise,
interference and congestion. In order to avoid the valuable
information from being dropped various retransmission schemes have
been proposed. In this proposed scheme QTD is used. QTD is an
image segmentation method that divides the image into homogeneous
areas. In this proposed scheme involves analysis of parameters such
as compression ratio, peak signal to noise ratio, mean square error,
bits per pixel in compressed image and analysis of difficulties during
data packet communication in Wireless Sensor Networks. By
considering the above, this paper is to use the QTD to improve the
compression ratio as well as visual quality and the algorithm in
MATLAB 7.1 and NS2 Simulator software tool.
Abstract: In this paper, an edge-strength guided multiscale
retinex (EGMSR) approach will be proposed for color image contrast
enhancement. In EGMSR, the pixel-dependent weight associated with
each pixel in the single scale retinex output image is computed
according to the edge strength around this pixel in order to prevent
from over-enhancing the noises contained in the smooth dark/bright
regions. Further, by fusing together the enhanced results of EGMSR
and adaptive multiscale retinex (AMSR), we can get a natural fused
image having high contrast and proper tonal rendition. Experimental
results on several low-contrast images have shown that our proposed
approach can produce natural and appealing enhanced images.
Abstract: The process in which the complementary information from multiple images is integrated to provide composite image that contains more information than the original input images is called image fusion. Medical image fusion provides useful information from multimodality medical images that provides additional information to the doctor for diagnosis of diseases in a better way. This paper represents the wavelet based medical image fusion algorithm on different multimodality medical images. In order to fuse the medical images, images are decomposed using Redundant Wavelet Transform (RWT). The high frequency coefficients are convolved with morphological operator followed by the maximum-selection (MS) rule. The low frequency coefficients are processed by MS rule. The reconstructed image is obtained by inverse RWT. The quantitative measures which includes Mean, Standard Deviation, Average Gradient, Spatial frequency, Edge based Similarity Measures are considered for evaluating the fused images. The performance of this proposed method is compared with Pixel averaging, PCA, and DWT fusion methods. When compared with conventional methods, the proposed framework provides better performance for analysis of multimodality medical images.
Abstract: This paper describes an identification of specific shapes within binary images using the morphological Hit-or-Miss Transform (HMT). Hit-or-Miss transform is a general binary morphological operation that can be used in searching of particular patterns of foreground and background pixels in an image. It is actually a basic operation of binary morphology since almost all other binary morphological operators are derived from it. The input of this method is a binary image and a structuring element (a template which will be searched in a binary image) while the output is another binary image. In this paper a modification of Hit-or-Miss transform has been proposed. The accuracy of algorithm is adjusted according to the similarity of the template and the sought template. The implementation of this method has been done by C language. The algorithm has been tested on several images and the results have shown that this new method can be used for similar shape detection.
Abstract: The aim of this paper is image encryption using Genetic Algorithm (GA). The proposed encryption method consists of two phases. In modification phase, pixels locations are altered to reduce correlation among adjacent pixels. Then, pixels values are changed in the diffusion phase to encrypt the input image. Both phases are performed by GA with binary chromosomes. For modification phase, these binary patterns are generated by Local Binary Pattern (LBP) operator while for diffusion phase binary chromosomes are obtained by Bit Plane Slicing (BPS). Initial population in GA includes rows and columns of the input image. Instead of subjective selection of parents from this initial population, a random generator with predefined key is utilized. It is necessary to decrypt the coded image and reconstruct the initial input image. Fitness function is defined as average of transition from 0 to 1 in LBP image and histogram uniformity in modification and diffusion phases, respectively. Randomness of the encrypted image is measured by entropy, correlation coefficients and histogram analysis. Experimental results show that the proposed method is fast enough and can be used effectively for image encryption.
Abstract: The research aims to approximate the amount of daily rainfall by using a pixel value data approach. The daily rainfall maps from the Thailand Meteorological Department in period of time from January to December 2013 were the data used in this study. The results showed that this approach can approximate the amount of daily rainfall with RMSE=3.343.
Abstract: The paper focuses on the problem of the point
correspondence matching in stereo images. The proposed matching
algorithm is based on the combination of simpler methods such as
normalized sum of squared differences (NSSD) and a more complex
phase correlation based approach, by considering the noise and other
factors, as well. The speed of NSSD and the preciseness of the
phase correlation together yield an efficient approach to find the best
candidate point with sub-pixel accuracy in stereo image pairs. The
task of the NSSD in this case is to approach the candidate pixel
roughly. Afterwards the location of the candidate is refined by an
enhanced phase correlation based method which in contrast to the
NSSD has to run only once for each selected pixel.
Abstract: Reversible watermarking that not only protects the copyright but also preserve the original quality of the digital content have been intensively studied. In particular, the demand for reversible watermarking has increased. In this paper, we propose a reversible watermarking scheme based on interpolation-error shifting and error pre-compensation. The intensity of a pixel is interpolated from the intensities of neighboring pixels, and the difference histogram between the interpolated and the original intensities is obtained and modified to embed the watermark message. By restoring the difference histogram, the embedded watermark is extracted and the original image is recovered by compensating for the interpolation error. The overflow and underflow are prevented by error pre-compensation. To show the performance of the method, the proposed algorithm is compared with other methods using various test images.