Image Registration Algorithm Using Mexican Hat Function-Based Operator and Grouped Feature Matching Strategy

Feature detection and matching are crucial for robust and reliable image registration. Although many methods have been developed, they commonly focus on only one class of image features. The methods that combine two or more classes of features are still novel and significant. In this work, methods for feature detection and matching are proposed. A Mexican hat function-based operator is used for image feature detection, including the local area detection and the feature point detection. For the local area detection, we use the Mexican hat operator for image filtering, and then the zero-crossing points are extracted and merged into the area borders. For the feature point detection, the Mexican hat operator is performed in scale space to get the key points. After the feature detection, an image registration is achieved by using the two classes of image features. The feature points are grouped according to a standardized region that contains correspondence to the local area, precise registration is achieved eventually by the grouped points. An image transformation matrix is estimated by the feature points in a region and then the best one is chosen through competition of a set of the transformation matrices. This strategy has been named the Grouped Sample Consensus (GCS). The GCS has also ability for removing the outliers effectively. The experimental results show that the proposed algorithm has high registration accuracy and small computational volume.     

Generation of diverse biological forms through combinatorial interactions between tissue polarity and growth

A major problem in biology is to understand how complex tissue shapes may arise through growth. In many cases this process involves preferential growth along particular orientations raising the question of how these orientations are specified. One view is that orientations are specified through stresses in the tissue (axiality-based system). Another possibility is that orientations can be specified independently of stresses through molecular signalling (polarity-based system). The axiality-based system has recently been explored through computational modelling. Here we develop and apply a polarity-based system which we call the Growing Polarised Tissue (GPT) framework. Tissue is treated as a continuous material within which regionally expressed factors under genetic control may interact and propagate. Polarity is established by signals that propagate through the tissue and is anchored in regions termed tissue polarity organisers that are also under genetic control. Rates of growth parallel or perpendicular to the local polarity may then be specified through a regulatory network. The resulting growth depends on how specified growth patterns interact within the constraints of mechanically connected tissue. This constraint leads to the emergence of features such as curvature that were not directly specified by the regulatory networks. Resultant growth feeds back to influence spatial arrangements and local orientations of tissue, allowing complex shapes to emerge from simple rules. Moreover, asymmetries may emerge through interactions between polarity fields. We illustrate the value of the GPT-framework for understanding morphogenesis by applying it to a growing Snapdragon flower and indicate how the underlying hypotheses may be tested by computational simulation. We propose that combinatorial intractions between orientations and rates of growth, which are a key feature of polarity-based systems, have been exploited during evolution to generate a range of observed biological shapes.     

The Construction and Use of Log-Odds Substitution Scores for Multiple Sequence Alignment

Most pairwise and multiple sequence alignment programs seek alignments with optimal scores. Central to defining such scores is selecting a set of substitution scores for aligned amino acids or nucleotides. For local pairwise alignment, substitution scores are implicitly of log-odds form. We now extend the log-odds formalism to multiple alignments, using Bayesian methods to construct “BILD” (“Bayesian Integral Log-odds”) substitution scores from prior distributions describing columns of related letters. This approach has been used previously only to define scores for aligning individual sequences to sequence profiles, but it has much broader applicability. We describe how to calculate BILD scores efficiently, and illustrate their uses in Gibbs sampling optimization procedures, gapped alignment, and the construction of hidden Markov model profiles. BILD scores enable automated selection of optimal motif and domain model widths, and can inform the decision of whether to include a sequence in a multiple alignment, and the selection of insertion and deletion locations. Other applications include the classification of related sequences into subfamilies, and the definition of profile-profile alignment scores. Although a fully realized multiple alignment program must rely upon more than substitution scores, many existing multiple alignment programs can be modified to employ BILD scores. We illustrate how simple BILD score based strategies can enhance the recognition of DNA binding domains, including the Api-AP2 domain in Toxoplasma gondii and Plasmodium falciparum.     

Vision-based force measurement using neural networks for biological cell microinjection

This paper presents a vision-based force measurement method using an artificial neural network model. The proposed model is used for measuring the applied load to a spherical biological cell during micromanipulation process. The devised vision-based method is most useful when force measurement capability is required, but it is very challenging or even infeasible to use a force sensor. Artificial neural networks in conjunction with image processing techniques have been used to estimate the applied load to a cell. A bio-micromanipulation system capable of force measurement has also been established in order to collect the training data required for the proposed neural network model. The geometric characterization of zebrafish embryos membranes has been performed during the penetration of the micropipette prior to piercing. The geometric features are extracted from images using image processing techniques. These features have been used to describe the shape and quantify the deformation of the cell at different indentation depths. The neural network is trained by taking the visual data as the input and the measured corresponding force as the output. Once the neural network is trained with sufficient number of data, it can be used as a precise sensor in bio-micromanipulation setups. However, the proposed neural network model is applicable for indentation of any other spherical elastic object. The results demonstrate the capability of the proposed method. The outcomes of this study could be useful for measuring force in biological cell micromanipulation processes such as injection of the mouse oocyte/embryo.     

Multiview Locally Linear Embedding for Effective Medical Image Retrieval

Content-based medical image retrieval continues to gain attention for its potential to assist radiological image interpretation and decision making. Many approaches have been proposed to improve the performance of medical image retrieval system, among which visual features such as SIFT, LBP, and intensity histogram play a critical role. Typically, these features are concatenated into a long vector to represent medical images, and thus traditional dimension reduction techniques such as locally linear embedding (LLE), principal component analysis (PCA), or laplacian eigenmaps (LE) can be employed to reduce the “curse of dimensionality”. Though these approaches show promising performance for medical image retrieval, the feature-concatenating method ignores the fact that different features have distinct physical meanings. In this paper, we propose a new method called multiview locally linear embedding (MLLE) for medical image retrieval. Following the patch alignment framework, MLLE preserves the geometric structure of the local patch in each feature space according to the LLE criterion. To explore complementary properties among a range of features, MLLE assigns different weights to local patches from different feature spaces. Finally, MLLE employs global coordinate alignment and alternating optimization techniques to learn a smooth low-dimensional embedding from different features. To justify the effectiveness of MLLE for medical image retrieval, we compare it with conventional spectral embedding methods. We conduct experiments on a subset of the IRMA medical image data set. Evaluation results show that MLLE outperforms state-of-the-art dimension reduction methods.     

An iterative region-growing process for cell image segmentation based on local color similarity and global shape criteria

An image segmentation process was derived from an image model that assumed that cell images represent objects having characteristic relationships, limited shape properties and definite local color features. These assumptions allowed the design of a region-growing process in which the color features were used to iteratively aggregate image points in alternation with a test of the convexity of the aggregate obtained. The combination of both local and global criteria allowed the self-adaptation of the algorithm to segmentation difficulties and led to a self-assessment of the adequacy of the final segmentation result. The quality of the segmentation was evaluated by visual control of the match between cell images and the corresponding segmentation masks proposed by the algorithm. A comparison between this region-growing process and the conventional gray-level thresholding is illustrated. A field test involving 700 bone marrow cells, randomly selected from May-Grünwald-Giemsa-stained smears, allowed the evaluation of the efficiency, effectiveness and confidence of the algorithm: 96% of the cells were evaluated as correctly segmented by the algorithm's self-assessment of adequacy, with a 98% confidence. The principles of the other major segmentation algorithms are also reviewed.     

基于颜色名和OpponentSIFT特征的鳞翅目昆虫图像识别

【目的】本研究旨在探索使用先进的计算机视觉技术实现对昆虫图像的自动分类方法。【方法】通过预处理对采集的昆虫标本图像去除背景,获得昆虫图像的前景蒙板,并由蒙板确定的轮廓计算出前景图像的最小包围盒,剪切出由最小包围盒确定的前景有效区域,然后对剪切得到的图像进行特征提取。首先提取颜色名特征,把原来的RGB（Red-Green-Blue）图像的像素值映射到11种颜色名空间,其值表示RGB值属于该颜色名的概率,每个颜色名平面划分成3×3像素大小的网格,用每格的概率均值作为网格中心点的描述子,最后用空阈金字塔直方图统计的方式形成颜色名视觉词袋特征;其次提取OpponentSIFT(Opponent Scale Invariant Feature Transform)特征,首先把RGB图像变换到对立色空间,对该空间每通道提取SIFT特征,最后用空域池化和直方图统计方法形成OpponentSIFT视觉词袋。将两种词袋特征串接后得到该昆虫图像的特征向量。使用昆虫图像样本训练集提取到的特征向量训练SVM（Support Vector Machine）分类器,使用这些训练得到的分类器即可实现对鳞翅目昆虫的分类识别。【结果】该方法在包含10种576个样本的昆虫图像数据库中进行了测试,取得了100%的识别正确率。【结论】试验结果证明基于颜色名和OpponentSIFT特征可以有效实现对鳞翅目昆虫图像的识别。     

Rotation-Invariant Features for Multi-Oriented Text Detection in Natural Images

Texts in natural scenes carry rich semantic information, which can be used to assist a wide range of applications, such as object recognition, image/video retrieval, mapping/navigation, and human computer interaction. However, most existing systems are designed to detect and recognize horizontal (or near-horizontal) texts. Due to the increasing popularity of mobile-computing devices and applications, detecting texts of varying orientations from natural images under less controlled conditions has become an important but challenging task. In this paper, we propose a new algorithm to detect texts of varying orientations. Our algorithm is based on a two-level classification scheme and two sets of features specially designed for capturing the intrinsic characteristics of texts. To better evaluate the proposed method and compare it with the competing algorithms, we generate a comprehensive dataset with various types of texts in diverse real-world scenes. We also propose a new evaluation protocol, which is more suitable for benchmarking algorithms for detecting texts in varying orientations. Experiments on benchmark datasets demonstrate that our system compares favorably with the state-of-the-art algorithms when handling horizontal texts and achieves significantly enhanced performance on variant texts in complex natural scenes.     

Analysis of fragmented images perception: local features and global description

Analysis of experimental investigations of the perception of incomplete images is presented. It illustrates two different approaches to work of the brain mechanisms involved: one approach is based on the perception of whole images and another on local informative features. These approaches describe two different mechanisms, which are possibly used by brain systems for incomplete image recognition. Performance on the Gollin test (measuring recognition thresholds for fragmented line drawings of everyday objects and animals) depends upon recognition based on image informational-statistical characteristics. We suggest that recognition thresholds for Gollin stimuli in part reflect the extraction of signal from noise. The brain uses local informative features as an additional source of information about them. We have suggested that fragmented images in the Gollin-test are perceived as whole structures. This structure is compared with a template in memory which is extracted with the help of selective attention mechanism in accordance with a matched filtration model. The Gollin-test is a tool for differential diagnosis of a various forms of cognitive disorders.