An enhancement to SIFT-based techniques for image registration
- Authors: Hossain, Tanvir , Teng, Shyh , Lu, Guojun , Lackmann, Martin
- Date: 2010
- Type: Text , Conference paper
- Relation: Proceedings of the 2010 Digital Image Computing: Techniques and Applications p. 166-171
- Full Text: false
- Reviewed:
- Description: Symmetric-SIFT is a recently proposed local technique used for registering multimodal images. It is based on a well-known general image registration technique named Scale Invariant Feature Transform (SIFT). Symmetric SIFT makes use of the gradient magnitude information at the image's key regions to build the descriptors. In this paper, we highlight an issue with how the magnitude information is used in this process. This issue may result in similar descriptors being built to represent regions in images that are visually different. To address this issue, we have proposed two new strategies for weighting the descriptors. Our experimental results show that Symmetric-SIFT descriptors built using our proposed strategies can lead to better registration accuracy than descriptors built using the original Symmetric-SIFT technique. The issue highlighted and the two strategies proposed are also applicable to the general SIFT technique.
An L-2-Boosting Algorithm for Estimation of a Regression Function
- Authors: Bagirov, Adil , Clausen, Conny , Kohler, Michael
- Date: 2010
- Type: Text , Journal article
- Relation: IEEE Transactions on Information Theory Vol. 56, no. 3 (2010), p. 1417-1429
- Full Text:
- Reviewed:
- Description: An L-2-boosting algorithm for estimation of a regression function from random design is presented, which consists of fitting repeatedly a function from a fixed nonlinear function space to the residuals of the data by least squares and by defining the estimate as a linear combination of the resulting least squares estimates. Splitting of the sample is used to decide after how many iterations of smoothing of the residuals the algorithm terminates. The rate of convergence of the algorithm is analyzed in case of an unbounded response variable. The method is used to fit a sum of maxima of minima of linear functions to a given data set, and is compared with other nonparametric regression estimates using simulated data.
Automated multi-sensor color video fusion for nighttime video surveillance
- Authors: Ul-Haq, Anwaar , Gondal, Iqbal , Murshed, Manzur
- Date: 2010
- Type: Text , Conference proceedings
- Full Text: false
- Description: In this paper, we present an automated color transfer based video fusion method to attain real-time color night vision capability for night-time video surveillance. We utilize simple RGB Color transfer technique to fused pseudo colored video frames without conversion to any uncorrelated color space. We investigated that final color fusion results greatly depend on the selection of target color Image. Therefore, rather than using any arbitrary target color image based on mere general visual anticipation, we have automated target color image selection using structural similarity and color saturation. We further apply color enhancement to improve final appearance of color fused images. Subjective and objective quality evaluations greatly indicate the effectiveness of our color video fusion method for nighttime video surveillance applications.
Binary-organoid particle swarm optimisation for inferring genetic networks
- Authors: Chanthaphavong, Santi , Chetty, Madhu
- Date: 2010
- Type: Text , Conference paper
- Relation: Evolutionary Computation (CEC), 2010 IEEE Congress
- Full Text: false
- Reviewed:
- Description: A holistic understanding of genetic interactions is crucial in the analysis of complex biological systems. However, due to the dimensionality problem (less samples and large number of genes) of microarray data, obtaining an optimal gene regulatory network is not only difficult but also computationally expensive. In this paper, a Bayesian model for the genetic interactions using the Minimum Description Length as a scoring metric is proposed. For fast optimisation of the network structure, we propose a novel Swarm Intelligence algorithm called Binary-Organoid Particle Swarm (BORG-Swarm). In BORG-Swarm we introduce the concepts of probability threshold vector and particle drift to update particle positions. Experimental studies are carried out using real-life yeast cell cycle dataset. Results indicate that existing binary swarms fail to converge and suffer from long runtimes. In constrast, BORG-Swarm's fast convergence towards the global optimum becomes apparent from results of extensive simulations.
Clustered memetic algorithm for protein structure prediction
- Authors: Islam, M. D. , Chetty, Madhu
- Date: 2010
- Type: Text , Conference paper
- Relation: Evolutionary Computation (CEC), 2010 IEEE Congress
- Full Text:
- Reviewed:
Detection and separation of generic-shaped objects by fuzzy clustering
- Authors: Ali, Mohammad , Karmakar, Gour , Dooley, Laurence
- Date: 2010
- Type: Text , Journal article
- Relation: International Journal of Intelligent Computing and Cybernetics Vol. 3, no. 3 (2010 2010), p. 365-390
- Full Text: false
- Reviewed:
- Description: Image segmentation involves the separation of mutually exclusive regions/objects of interest (Gonzalez and Woods, 2002), and is integral to the image processing, coding and interpretation domains, with examples of some of the eclectic range of applications including: image analysis, robot vision, automatic car assembly, security surveillance systems, object recognition and medical imaging (Gonzalez and Woods, 2002; Hoppner et al., 1999; Pham and Prince, 1999; Gath and Geva, 1989; Pal and Pal, 1993). As there are potentially a very large number of perceptual objects in an image, with subtle variations between them, this makes generalised object-based segmentation an especially challenging task.
Feature weighting and retrieval methods for dynamic texture motion features
- Authors: Rahman, Ashfaqur , Murshed, Manzur
- Date: 2010
- Type: Text , Journal article
- Relation: International Journal of Computational Intelligence Systems Vol. 2, no. 1 (2010 2010), p. 27-38
- Full Text:
- Reviewed:
- Description: Feature weighing methods are commonly used to find the relative significance among a set of features that are effectively used by the retrieval methods to search image sequences efficiently from large databases. As evidenced in the current literature, dynamic textures (image sequences with regular motion patterns) can be effectively modelled by a set of spatial and temporal motion distribution features like motion co-occurrence matrix. The aim of this paper is to develop effective feature weighting and retrieval methods for a set of dynamic textures while characterized by motion co-occurrence matrices.
Investment decision model via an improved BP neural network
- Authors: Shen, Jihong , Zhang, Canxin , Lian, Chunbo , Hu, Hao , Mammadov, Musa
- Date: 2010
- Type: Text , Conference paper
- Relation: Paper presented at 2010 IEEE International Conference on Information and Automation, ICIA 2010, Harbin, Heilongjiang 20th-23rd June 2010 p. 2092-2096
- Full Text:
- Description: In macro investment, an investment decision model is established by using an improved back propagation (BP) artificial neural network (ANN). In this paper, the relations between elements of investment and output of products are determined, and then the optimal distribution of investment is determined by adjusting the distributions rationally. This model can reflect the highly nonlinear mapping relations among each element of investment by using nonlinear utility functions to improve the architecture of artificial neural network, which can be widely applied in investment problems. ©2010 IEEE.
Learning naive Bayes classifiers for music classification and retrieval
- Authors: Fu, Zhouyu , Lu, Guojun , Ting, Kaiming , Zhang, Dengsheng
- Date: 2010
- Type: Text , Conference paper
- Relation: Proceedings of the 20th International Conference on Pattern Recognition p. 4589-4592
- Full Text: false
- Reviewed:
- Description: In this paper, we explore the use of naive Bayes classifiers for music classification and retrieval. The motivation is to employ all audio features extracted from local windows for classification instead of just using a single song-level feature vector produced by compressing the local features. Two variants of naive Bayes classifiers are studied based on the extensions of standard nearest neighbor and support vector machine classifiers. Experimental results have demonstrated superior performance achieved by the proposed naive Bayes classifiers for both music classification and retrieval as compared to the alternative methods.
Mass estimation and its applications
- Authors: Ting, Kaiming , Zhou, Guangtong , Liu, Fei , Chuan, J. T. S.
- Date: 2010
- Type: Text , Conference paper
- Relation: Proceedings of the 16th ACM SIGKDD Conference on Knowledge Discovery and Data Mining p. 989-998
- Full Text: false
- Reviewed:
- Description: This paper introduces mass estimation--a base modelling mechanism in data mining. It provides the theoretical basis of mass and an efficient method to estimate mass. We show that it solves problems very effectively in tasks such as information retrieval, regression and anomaly detection. The models, which use mass in these three tasks, perform at least as good as and often better than a total of eight state-of-the-art methods in terms of task-specific performance measures. In addition, mass estimation has constant time and space complexities.
Modelling gene regulatory networks using computational intelligence techniques
- Authors: Ram, Ramesh , Chetty, Madhu
- Date: 2010
- Type: Text , Book chapter
- Relation: Handbook of Research on Computational Methodologies in Gene Regulatory Networks p. 244-265
- Full Text: false
- Reviewed:
- Description: This chapter presents modelling gene regulatory networks (GRNs) using probabilistic causal model and the guided genetic algorithm. The problem of modelling is explained from both a biological and computational perspective. Further, a comprehensive methodology for developing a GRN model is presented where the application of computation intelligence (CI) techniques can be seen to be significantly important in each phase of modelling. An illustrative example of the causal model for GRN modelling is also included and applied to model the yeast cell cycle dataset. The results obtained are compared for providing biological relevance to the findings which thereby underpins the CI based modelling techniques.
Motion compensation for block-based lossless video coding using lattice-based binning
- Authors: Ali, Mortuza , Murshed, Manzur
- Date: 2010
- Type: Text , Conference paper
- Full Text: false
- Reviewed:
- Description: Abstract— A block-based lossless video coding scheme using the notion of binning has been proposed in [1]. To further improve the compression and reduce the complexity, in this paper we investigate the impact of two sub-optimal motion search algorithms on the performance of this lattice-based scheme. While one of the algorithm tries avoiding motion vectors, the other tries to reduce complexity. Our experimental results have demonstrated that the loss due to sub-optimal motion search outweighs the gain when motion vectors are avoided. However, experimental results have shown that there is negligible performance loss when lowcomplexity sub-optimal three step search is used.
Multi-dimensional mass estimation and mass-based clustering
- Authors: Ting, Kaiming , Wells, Jonathan
- Date: 2010
- Type: Text , Conference paper
- Relation: Proceedings of the 10th IEEE International Conference on Data Mining (ICDM) p. 511-520
- Full Text: false
- Reviewed:
- Description: Mass estimation, an alternative to density estimation, has been shown recently to be an effective base modelling mechanism for three data mining tasks of regression, information retrieval and anomaly detection. This paper advances this work in two directions. First, we generalise the previously proposed one-dimensional mass estimation to multidimensional mass estimation, and significantly reduce the time complexity to O(ψh) from O(ψ h )-making it feasible for a full range of generic problems. Second, we introduce the first clustering method based on mass-it is unique because it does not employ any distance or density measure. The structure of the new mass model enables different parts of a cluster to be identified and merged without expensive evaluations. The characteristics of the new clustering method are: (i) it can identify arbitrary-shape clusters; (ii) it is significantly faster than existing density-based or distance-based methods; and (iii) it is noise-tolerant.
- Description: Mass estimation, an alternative to density estimation, has been shown recently to be an effective base modelling mechanism for three data mining tasks of regression, information retrieval and anomaly detection. This paper advances this work in two directions. First, we generalise the previously proposed one-dimensional mass estimation to multidimensional mass estimation, and significantly reduce the time complexity to O(
Multiclass microarray gene expression classification based on fusion of correlation features
- Authors: Chetty, Girija , Chetty, Madhu
- Date: 2010
- Type: Text , Conference paper
- Relation: Information Fusion (FUSION), 2010 13th Conference
- Full Text: false
- Reviewed:
- Description: In this paper, we propose novel algorithmic models based on fusion of independent and correlated gene features for multiclass microarray gene expression classification. It is possible for genes to get co-expressed via different pathways. Moreover, a gene may or may not be co-active for all samples. In this paper, we approach this problem with a optimal feature selection technique using analysis based on statistical techniques to model the complex interactions between genes. The two different types of correlation modelling techniques based on the cross modal factor analysis (CFA) and canonical correlation analysis (CCA) were examined. The subsequent fusion of CCA/CFA features with principal component analysis (PCA) features at feature-level, and at score-level result in significant enhancement in classification accuracy for different data sets corresponding to multiclass microarray gene expression data.
Novel spectral descriptor for object shape
- Authors: Sajjanhar, Atul , Lu, Guojun , Zhang, Dengsheng
- Date: 2010
- Type: Text , Book chapter
- Relation: Proceedings of the 11th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing p. 58-67
- Full Text:
- Reviewed:
- Description: In this paper, we propose a novel descriptor for shapes. The proposed descriptor is obtained from 3D spherical harmonics. The inadequacy of 2D spherical harmonics is addressed and the method to obtain 3D spherical harmonics is described. 3D spherical harmonics requires construction of a 3D model which implicitly represents rich features of objects. Spherical harmonics are used to obtain descriptors from the 3D models. The performance of the proposed method is compared against the CSS approach which is the MPEG-7 descriptor for shape contour. MPEG-7 dataset of shape contours, namely, CE-1 is used to perform the experiments. It is shown that the proposed method is effective
Pattern recognition in bioinformatics : Girls lose out
- Authors: Ahmad, Shandar , Chetty, Madhu , Schmidt, Bertil
- Date: 2010
- Type: Text , Journal article
- Relation: Pattern Recognition Letter Vol. 31, no. 14 (2010), p. 2071-2072
- Full Text: false
- Reviewed:
- Description: Editorial- With the advent of high speed computers, in-silico studies on biological patterns in recent years have been significantly impacted by the pattern recognition techniques. In this special issue, ‘Pattern Recognition in Bioinformatics’, we present various sophisticated algorithms for a wide range of pattern recognition problems from the world of complex biological systems, whether these are specific sequence signatures – motifs that stand out in discovering its partner – or substructures in an interaction network that determines an organisms’ response to external stimuli. The 12 high-quality articles included in this special issue are essentially based on significant extensions of the selected papers presented at the Third International Conference on Pattern Recognition in Bioinformatics (PRIB 2008) held in Melbourne, Australia. All these selected papers for special issue have again undergone a thorough review by at least three reviewers who are experts in the field. The fresh review process was followed to ensure that the papers met the high standards of scientific and technical merit of the Pattern Recognition Letters journal. The issue is broadly divided into three sections of four papers each, namely (1) Section 1: Interaction Networks and Feature-based Predictions (2) Section 2: Microarray and Transcription Data Analysis (3) Section 3: Sequence Analysis and Motif Discovery
Region based color image retrieval using curvelet transform
- Authors: Islam, Md , Zhang, Dengsheng , Lu, Guojun
- Date: 2010
- Type: Text , Conference paper
- Relation: Proceedings of the 9th Asian Conference on Computer Vision p. 448-457
- Full Text: false
- Reviewed:
- Description: Effective texture feature is an essential component in any content based image retrieval system. In the past, spectral features, like Gabor and wavelet, have shown superior retrieval performance than many other statistical and structural based features. Recent researches on multi-resolution analysis have found that curvelet captures texture properties, like curves, lines, and edges, more accurately than Gabor filters. However, the texture feature extracted using curvelet transform is not rotation invariant. This can degrade its retrieval performance significantly, especially in cases where there are many similar images with different orientations. This paper analyses the curvelet transform and derives a useful approach to extract rotation invariant curvelet features. Experimental results show that the new rotation invariant curvelet feature outperforms the curvelet feature without rotation invariance.
Relevance feature mapping for content-based image retrieval
- Authors: Zhou, Guang , Ting, Kaiming , Liu, Fei , Yin, Yilong
- Date: 2010
- Type: Text , Conference paper
- Relation: 16th ACM SIGKDD Workshop on Multimedia Data Mining p. 1-10
- Full Text: false
- Reviewed:
Scarf : Semi-automatic colorization and reliable image fusion
- Authors: Ul-Haq, Anwaar , Gondal, Iqbal , Murshed, Manzur
- Date: 2010
- Type: Text , Conference paper
- Relation: 2010 Digital Image Computing: Techniques and Applications p. 435-440
- Full Text: false
- Reviewed:
- Description: Nighttime imagery poses significant challenges to its enhancement due to loss of color information and limitation of single sensor to capture complete visual information at night. To cope with this challenge, multiple sensors are used to capture reliable nighttime imagery which presents additional demands for reliable visual information fusion. In this paper, we present a system, Scarf, which proposes reliable image fusion using advanced feature extraction techniques and a novel semi-automatic colorization based on optimization conformal to human visual system. Subjective and objective quality evaluation proves the effectiveness of proposed system.
Video coding focusing on block partitioning and occlusion
- Authors: Paul, Manoranjan , Murshed, Manzur
- Date: 2010
- Type: Text , Journal article
- Relation: IEEE Transactions on Image Processing Vol. 19, no. 3 (2010), p. 691-701
- Full Text: false
- Reviewed:
- Description: Among the existing block partitioning schemes, the pattern-based video coding (PVC) has already established its superiority at low bit-rate. Its innovative segmentation process with regular-shaped pattern templates is very fast as it avoids handling the exact shape of the moving objects. It also judiciously encodes the pattern-uncovered background segments capturing high level of interblock temporal redundancy without any motion compensation, which is favoured by the rate-distortion optimizer at low bit-rates. The existing PVC technique, however, uses a number of content-sensitive thresholds and thus setting them to any predefined values risks ignoring some of the macroblocks that would otherwise be encoded with patterns. Furthermore, occluded background can potentially degrade the performance of this technique. In this paper, a robust PVC scheme is proposed by removing all the content-sensitive thresholds, introducing a new similarity metric, considering multiple top-ranked patterns by the rate-distortion optimizer, and refining the Lagrangian multiplier of the H.264 standard for efficient embedding. A novel pattern-based residual encoding approach is also integrated to address the occlusion issue. Once embedded into the H.264 Baseline profile, the proposed PVC scheme improves the image quality perceptually significantly by at least 0.5 dB in low bit-rate video coding applications. A similar trend is observed for moderate to high bit-rate applications when the proposed scheme replaces the bi-directional predictive mode in the H.264 High profile.