Статьи журнала - International Journal of Image, Graphics and Signal Processing
Все статьи: 1092
Dual Transition Uniform Lbp Matrix for Efficient Image Retrieval
Статья научная
Texture image retrieval plays a significant and important role in these days, especially in the era of big-data. The big-data is mainly represented by unstructured data like images, videos and messages etc. Efficient methods of image retrieval that reduces the complexity of the existing methods is need for the big-data era. The present paper proposes a new method of texture retrieval based on local binary pattern (LBP) approach. One of the main disadvantages of LBP is, it generates 256 different patterns on a 3x3 neighborhood and a method based on this for retrieval needs 256 comparisons which is very tedious and complex. The retrieval methods based on uniform LBP's which consists of 59 different patterns of LBP is also complex in nature. To overcome this, the present paper divided LBP into dual LBP's consisting four pixels. The present paper based on this dual LBP derived a 2-dimensional dual uniform LBP matrix (DULBPM) that contains only four entries. The texture image retrieval is performed using these four entries of DULBPM. The proposed method is evaluated on the animal fur, car, leaf and rubber textures.
Бесплатно
Dynamic Adaptive Median Filter (DAMF) for Removal of High Density Impulse Noise
Статья научная
This paper proposes a novel adaptive filtering scheme to remove impulse noise from images. The scheme replaces the corrupted test pixel with the median value of non-corrupted neighboring pixels selected from a window dynamically. If the number of non-corrupted pixels in the selected window is not sufficient, a window of next higher size is chosen. Thus window size is automatically adapted based on the density of noise in the image as well as the density of corruption local to a window. As a result window size may vary pixel to pixel while filtering. The scheme is simple to implement and do not require multiple iterations. The efficacy of the proposed scheme is evaluated with respect to subjective as well as objective parameters on standard images on various noise densities. Comparative analysis reveals that the proposed scheme has improved performance over other schemes, preferably in high density impulse noise cases. Further, the computational overhead is also less as compared its competent scheme.
Бесплатно
Dynamic Summarization of Video Using Minimum Edge Weight Matching in Bipartite Graphs
Статья научная
To select the long-running videos from online archives and other collections, the users would like to browse, or skim through quickly to get a hint on the semantic content of the videos. Video summarization addresses this problem by providing a short video summary of a full-length video. An ideal video summary would include all the important segments of the video and remain short in length. The problem of summarization is extremely challenging and has been a widely pursued subject of recent research. There are many algorithms presented in literature for video summarization and they represent visual information of video in concise form. Dynamic summaries are constructed with collection of key frames or some smaller segments extracted from video and is presented in the form of small video clip. This paper describes an algorithm for constructing the dynamic summary of a video by modeling every 40 consecutive frames of video as a bipartite graph. The method considers every 20 consecutive frames from video as one set and next 20 consecutive frames as second set of bipartite graph nodes with frames of the video representing nodes of the graph and edges connecting nodes denoting the relation between frames and edge weight depicting the mutual information between frames. Then the minimum edge weight maximal matching in every bipartite graph (a set of pair wise non-adjacent edges) is found using Hungarian method. The frames from the matchings which are represented by the nodes connected by the edges with weight below some empirically defined threshold and two neighbor frames are taken as representative frames to construct the summary. The results of the experiments conducted on data set containing sports videos taken from YOUTUBE and videos of TRECVID MED 2011 dataset have demonstrated the satisfactory average values of performance parameters, namely Informativeness value of 94 % and Satisfaction value of 92 %. These values and duration (MSD) of summaries reveal that the summaries constructed are significantly concise and highly informative and provide highly acceptable dynamic summary of the videos.
Бесплатно
EEG based Autism Diagnosis Using Regularized Fisher Linear Discriminant Analysis
Статья научная
Diagnosis of autism is one of the difficult problems facing researchers. To reveal the discriminative pattern between autistic and normal children via electroencephalogram (EEG) analysis is a big challenge. The feature extraction is averaged Fast Fourier Transform (FFT) with the Regulated Fisher Linear Discriminant (RFLD) classifier. Gaussinaty condition for the optimality of Regulated Fisher Linear Discriminant (RFLD) has been achieved by a well-conditioned appropriate preprocessing of the data, as well as optimal shrinkage technique for the Lambda parameter. Winsorised Filtered Data gave the best result.
Бесплатно
EFF-ViBE: an efficient and improved background subtraction approach based on ViBE
Статья научная
Background subtraction plays an important role in intelligent video surveillance since it is one of the most used tools in motion detection. If scientific progress has enabled to develop sophisticated equipment for this task, algorithms used should be improved as well. For the past decade a background subtraction technique called ViBE is gaining the field. However, the original algorithm has two main drawbacks. The first one is ghost phenomenon which appears if the initial frame contains a moving object or in the case of a sudden change in the background situations. Secondly it fails to perform well in complicated background. This paper presents an efficient background subtraction approach based on ViBE to solve these two problems. It is based on an adaptive radius to deal with complex background, on cumulative mean and pixel counting mechanism to quickly eliminate the ghost phenomenon and to adapt to sudden change in the background model.
Бесплатно
Статья научная
Radio resource allocation in VCN is a challenging role in an intelligent transportation system due to traffic congestion. Lot of time is wasted because of traffic congestion. Due to traffic congestion, user have to miss their important work. In this paper, we propose radio resource allocation scheme so that user can utilize their time by taking the advantage of subscription plan. In this scenario, multitype vehicle identification scheme from real time traffic database is proposed, its history will match in transport database and vehicle travelling history database. Proposed method indicates 95% accuracy for multitype vehicle detection. Subscription plans are allocated to the user on the basis of resource allocation, scheduling, levelling and forecasting. This scheme is better for traffic management, vehicle tracking as well as time management.
Бесплатно
EQ: An Eigen Image Quality Assessment based on the Complement Feature
Статья научная
An Eigen formulation is proposed for image quality assessment IQA. Each block is represented by an array composed of feature vectors (intensity/color at this stage). After attaching the complement feature(s), the auto-correlation matrix is computed for each block. The proposed full reference FR-IQA is simply the deviation of the Eigen values of the degraded image from that of the original image. Interestingly, the second largest Eigen value was sufficient to perform this comparison. Results and comparisons with SSIM and GMSD schemes on different types of degradation are demonstrated to show the effectiveness of the proposed schemes. Using TID2013 database, the proposed scheme outperforms SSIM. In addition, the proposed schemes is closer to the MOS score compared to GMSD; however, the correlation with MOS is inferior as illustrated in the tables. These results are concluded from the average behaviour on all the images using all degradations (with 5 levels) on the database.
Бесплатно
Early detection of osteoarthritis based on cartilage thickness in knee X-ray images
Статья научная
Arthritis is a joint disorder featuring inflammation. There are numerous forms of Arthritis. Arthritis essentially causes joint dis-functioning which may further tend to cause deformity and disability. Osteoarthritis (OA) is one form of arthritis which is mostly seen in old age group. A patient suffering from OA needs to visit medical experts where clinical and radiographic examination is carried out. Analysis of bone structures in initial stage is bit complex. So any vague conclusion drawn from the radiographic images may make the treatment faulty and troublesome. Thus to overcome this we have developed an algorithm that computes the cartilage area/thickness using various shape descriptors. The computed descriptors obtained the accuracy of 99.81% for K-nearest neighbour classifier and 95.09% for decision tree classifier. The estimated cartilage thickness is validated by radiographic experts as per KL grading framework which will be helpful to the doctors for quick and appropriate analysis of ailment in the early stage. The results are competitive and promising as reported in the literature.
Бесплатно
Earth Observation Satellites Scheduling Based on Decomposition Optimization Algorithm
Статья научная
A decomposition-based optimization algorithm was proposed for solving Earth Observation Satellites scheduling problem. The problem was decomposed into task assignment main problem and single satellite scheduling sub-problem. In task assignment phase, the tasks were allocated to the satellites, and each satellite would schedule the task respectively in single satellite scheduling phase. We adopted an adaptive ant colony optimization algorithm to search the optimal task assignment scheme. Adaptive parameter adjusting strategy and pheromone trail smoothing strategy were introduced to balance the exploration and the exploitation of search process. A heuristic algorithm and a very fast simulated annealing algorithm were proposed to solve the single satellite scheduling problem. The task assignment scheme was valued by integrating the observation scheduling result of multiple satellites. The result was responded to the ant colony optimization algorithm, which can guide the search process of ant colony optimization. Computation results showed that the approach was effective to the satellites observation scheduling problem.
Бесплатно
Edge Detection Operators: Peak Signal to Noise Ratio Based Comparison
Статья научная
Edge detection is the vital task in digital image processing. It makes the image segmentation and pattern recognition more comfort. It also helps for object detection. There are many edge detectors available for pre-processing in computer vision. But, Canny, Sobel, Laplacian of Gaussian (LoG), Robert’s and Prewitt are most applied algorithms. This paper compares each of these operators by the manner of checking Peak signal to Noise Ratio (PSNR) and Mean Squared Error (MSE) of resultant image. It evaluates the performance of each algorithm with Matlab and Java. The set of four universally standardized test images are used for the experimentation. The PSNR and MSE results are numeric values, based on that, performance of algorithms identified. The time required for each algorithm to detect edges is also documented. After the Experimentation, Canny operator found as the best among others in edge detection accuracy.
Бесплатно
Edge Detection System using Pulse Mode Neural Network for Image Enhancement
Статья научная
Edge detection of an image reduces significantly the amount of data and filters out information that may be regarded as less irrelevant. Edge detection is efficient in medical imaging. Pulse mode neural networks are becoming an attractive solution for function approximation based on frequency modulation. Early pulse mode implementation suffers from some network constraints due to weight range limitations. To provide the best edge detection, the basic algorithm is modified to have pulse mode operations for effective hardware implementation. In this project a new pulse mode network architecture using floating point operations is used in the activation function. By using floating point number system for synapse weight value representation, any function can be approximated by the network. The proposed pulse mode MNN is used to detect the edges in images forming a heterogeneous data base. It shows good learning capability. In addition, four edge detection techniques have been compared. The coding is written in verilog and the final result have been simulated using Xilinx ISE simulator.
Бесплатно
Статья научная
Ant Colony Optimization (ACO) is nature inspired algorithm based on foraging behavior of ants. The algorithm is based on the fact how ants deposit pheromone while searching for food. ACO generates a pheromone matrix which gives the edge information present at each pixel position of image, formed by ants dispatched on image. The movement of ants depends on local variance of image's intensity value. This paper proposes an improved method based on heuristic which assigns weight to the neighborhood. Thus by assigning the weights or priority to the neighboring pixels, the ant decides in which direction it can move. The method is applied on Medical images and experimental results are provided to support the superior performance of the proposed approach and the existing method.
Бесплатно
Edge Information for Boosting Discriminating Power of Texture Retrieval Techniques
Статья научная
Texture is a powerful image property for object and scene characterization, consequently, a large number of techniques has been developed for describing, classifying and retrieving texture images. On the other hand, edge information is proven to be an important cue used by the human visual system. Several physiological experiments have shown that, when looking at an object, human eyes explore different locations of that object through saccadic eye movements but they spend more time fixating edge regions. Based on this result, we hypothesize that a better performance could be obtained when analyzing an image (texture images in this case) if the visual features extracted from edge regions are given higher weights than those extracted from uniform regions. To check the validity of this hypothesis, we have modified several existing texture retrieval techniques in a way that incorporates the proposed idea and compared their performance with that of the original techniques. The results of the experiments that have been conducted on three common datasets confirmed the effectiveness of the proposed approach, since a significant improvement in the retrieval rate is obtained for all tested techniques. The experiments have also shown an improvement in the robustness to noise.
Бесплатно
Edge detection based on ant colony optimization using adaptive thresholding technique
Статья научная
Image edge detection is a process where true edges of an image are identified. In past, gradient based methods in which first or second order pixel difference is used to find discontinuities and if magnitude value of gradient is higher than certain threshold then that pixel under observation is identified as edge pixel. These methods are full of error, because in addition to true edges they also find false edges and infect false edges are more in comparison to true edges. To solve such problem, swarm intelligence based ant colony optimization based edge detection method is detailed where numbers of falsely detected edges are very small. The performance of the ant colony optimization (ACO) is done in terms of Peak Signal to Noise Ratio, Performance Ratio and Efficiency.
Бесплатно
Edibility detection of mushroom using ensemble methods
Статья научная
Mushrooms are the most familiar delicious food which is cholesterol free as well as rich in vitamins and minerals. Though nearly 45,000 species of mushrooms have been known throughout the world, most of them are poisonous and few are lethally poisonous. Identifying edible or poisonous mushroom through the naked eye is quite difficult. Even there is no easy rule for edibility identification using machine learning methods that work for all types of data. Our aim is to find a robust method for identifying mushrooms edibility with better performance than existing works. In this paper, three ensemble methods are used to detect the edibility of mushrooms: Bagging, Boosting, and random forest. By using the most significant features, five feature sets are made for making five base models of each ensemble method. The accuracy is measured for ensemble methods using five both fixed feature set-based models and randomly selected feature set based models, for two types of test sets. The result shows that better performance is obtained for methods made of fixed feature sets-based models than randomly selected feature set-based models. The highest accuracy is obtained for the proposed model-based random forest for both test sets.
Бесплатно
Effect of Reducing Colors Number on the Performance of CBIR System
Статья научная
Taking inspiration from the fact that a human can distinguish only a limited number of colors, reducing the number of colors is an interesting task to be incorpo-rated in image retrieval systems that is based on using only the most discriminative colors, which most of the time yields better results. Accordingly, the main goal of this paper is to study the influence on performance of reducing the colors number contained in images. Accomplishing this task poses an extra overhead on the system, which requires more com-putation time, but, on the other hand, can accelerate the comparison process. Due to their popularity and success, we specifically concentrate this study on histogram in-dexing methods, using both Euclidean distance and histo-gram intersection to assess consequently the distance and the similarity between images. Some simple, pertinent ideas related to the way we compare a pair of images using Euclidean Distance are given in the end of the pa-per, supported by preliminary obtained results.
Бесплатно
Effect of Single and Multiple ROI Coding on JPEG2000 Performance
Статья научная
Images are an integral part of advertisements. Images make the web pages heavy. It increases the response time if the size of the image is large and or available bandwidth is low. The consequence of it is viewer may lose his interest in the particular advertisement if he has to wait for a longer time. Image compression is one of the solutions to this problem. In advertisement images, ROI is of prime importance. Though the context of ROI and background regions are not of prime importance, they cannot be totally discarded. This paper investigates the effect of ROI coding on JPEG2000 performance. It proposes Multiple ROI (MROI) coding for compression of natural and advertisement images at moderate compression ratio. The proposed MROI coding prioritizes ROI codeblocks according to the ROI importance, and contribution of ROI in the specific ROI codeblock. It improves fine-grain accuracy at codeblock level also efficiently utilize the given bit budget with a negligible increase in encoding time.
Бесплатно
Effective Reverse Converter for General Three Moduli Set{(2^n)-1,(2^n)+1,(2^(pn+1))-1}
Статья научная
Residue number system is a non¬-weighted integer number system which uses the residues of division of ordinary numbers by some modules for representing that ordinary numbers. In this paper, the general three moduli set {(2^n)-1,(2^n)+1,(2^(pn+1))-1} based on CRT algorithm is proposed in which “p” is an even number greater than zero. The special case of this set for p=2 which is {(2^n)-1,(2^n)+1,(2^(pn+1))-1} is also described in this paper. Since the dynamic range of this set is odd, some difficult problems in RNS can be easily solved based on this set using parity checking. The proposed reverse converter is better in speed and hardware in comparison to reverse converters in similar dynamic range. Moreover, from the complexity point of view, the internal arithmetic circuits of this moduli set is improved and is less complex than the other sets in similar dynamic range.
Бесплатно
Статья научная
In this work, a 5 state left to right HMM-based Bangla Isolated word speech recognizer has been developed. To train and test the recognizer, a small corpus of various sampling frequencies have been developed in noisy as well as the noiseless environment. The number of filter banks is varied during the feature extraction phase for both MFCC and PLP. The effects of 2nd and 3rd differential coefficients have also been observed. Experimental results exhibit that MFCC based feature extraction technique is better in CLASSROOM environment on the contrary PLP based technique performs better not only in a noiseless environment but also in when AC or FAN noise is present. We have also noticed that higher sampling frequency and higher filter order don’t always help to improve the performance.
Бесплатно
Efficient 2D convolution filters implementations on graphics processing unit using NVIDIA CUDA
Статья научная
Convolution algorithms present a key component and a significant step in image processing field. Despite their high arithmetic complexity, these algorithms are widely used because of their great importance for extracting image properties and features. Convolution algorithms require significant computing time, for that we propose a GPU acceleration of these algorithms by using the programming language CUDA presented by NVIDIA. Since these algorithms consume a lot of computing power, we understand the impact of the implementation of this type of algorithm on the acceleration of processing. GPU implementation present a suitable path to achieve better results than other implementation , for that optimizing time consuming time consuming of applications became an increasingly important task in many research areas. The goal of this work is to try to boost convolution algorithms execution time by adopting GPU implementations to accelerate treatments and to achieve real time constraints.
Бесплатно
