Search

The texture image decomposition of porcelain fragments based on convolutional neural network is a functional algorithm based on energy minimization. It maps the image to a suitable space and can effectively decompose the image structure, texture, and noise. This paper conducts a systematic research on image decomposition based on variational method and compressed sensing reconstruction of convolutional neural network. This paper uses the layered variational image decomposition method to decompose the image into structural components and texture components and uses a compressed sensing algorithm based on hybrid basis to reconstruct the structure and texture components with large data. In compressed sensing, to further increase each feature component, the sparseness of tight framework wavelet-based shearlet transform is constructed and combined with wave atoms as a joint sparse dictionary big data. Under the condition of the same sampling rate, this algorithm can retain more image texture details and big data than the algorithm. The production of big data that meets the characteristics of the background text is actually an image-based normalization method. This method is not very sensitive to the relative position, density, spacing, and thickness of the text. A super-resolution model for certain texture features can improve the restoration effect of such texture images. And the dataset extracted by the classification method used in this paper accounts for 20% of the total dataset, and at the same time, the PSNR value of 0.1 is improved on average. Therefore, taking into account the requirements for future big data experimental training, this article mainly uses jpg/csv two standardized database datasets after segmentation. This dataset minimizes the difference between the same type of base text in the same period to lay the foundation for good big data recognition in the future.

Tongue diagnosis is one of the important methods in the Chinese traditional medicine. Doctors can judge the disease’s situation by observing patient’s tongue color and texture. This paper presents a novel approach to extract color and texture features of tongue images. First, we use improved GLA (Generalized Lloyd Algorithm) to extract the main color of tongue image. Considering that the color feature cannot fully express tongue image information, the paper analyzes tongue edge’s texture features and proposes an algorithm to extract them. Then, we integrate the two features in retrieval by different weight. Experimental results show that the proposed method can improve the detection rate of lesion in tongue image relative to single feature retrieval.

In this paper, we present and investigate an approach to fast multilabel color image segmentation using convex optimization techniques. The presented model is in some ways related to the well-known Mumford–Shah model, but deviates in certain important aspects. The optimization problem has been designed with two goals in mind. The objective function should represent fundamental concepts of image segmentation, such as incorporation of weighted curve length and variation of intensity in the segmented regions, while allowing transformation into a convex concave saddle point problem that is computationally inexpensive to solve. This paper introduces such a model, the nontrivial transformation of this model into a convex–concave saddle point problem, and the numerical treatment of the problem. We evaluate our approach by applying our algorithm to various images and show that our results are competitive in terms of quality at unprecedentedly low computation times. Our algorithm allows high-quality segmentation of megapixel images in a few seconds and achieves interactive performance for low resolution images (Fig. 1).

Purpose The low-dose computed tomography (CT) imaging can reduce the damage caused by x-ray radiation to the human body. However, low-dose CT images have a different degree of artifacts than conventional CT images, and their resolution is lower than that of conventional CT images, which can affect disease diagnosis by clinicians. Therefore, methods for noise-level reduction and resolution improvement in low-dose CT images have inevitably become a research hotspot in the field of low-dose CT imaging. Methods In this paper, residual attention modules (RAMs) are incorporated into the residual encoder-decoder convolutional neural network (RED-CNN) and generative adversarial network with Wasserstein distance (WGAN) to learn features that are beneficial to improving the performances of denoising networks, and developed models are denoted as RED-CNN-RAM and WGAN-RAM, respectively. In detail, RAM is composed of a multi-scale convolution module and an attention module built on the residual network architecture, where the attention module consists of a channel attention module and a spatial attention module. The residual network architecture solves the problem of network degradation with increased network depth. The function of the attention module is to learn which features are beneficial to reduce the noise level of low-dose CT images to reduce the loss of detail in the final denoising images, which is also the key point of the proposed algorithms. Results To develop a robust network for low-dose CT image denoising, multidose-level torso phantom images provided by a cooperating equipment vendor are used to train the network, which can improve the network's adaptability to clinical application. In addition, a clinical dataset is used to test the network's migration capabilities and clinical applicability. The experimental results demonstrate that these proposed networks can effectively remove noise and artifacts from multidose CT scans. Subjective and objective analyses of multiple groups of comparison experiments show that the proposed networks achieve good noise suppression performance while preserving the image texture details. Conclusion In this study, two deep learning network models are developed using multidose-level CT images acquired from a commercial spiral CT scanner. The two network models can reduce and even remove streaking artifacts, and noise from low-dose CT images confirms the effectiveness of the proposed algorithms.

Machine learning plays an important role in computational intelligence and has been widely used in many engineering fields. Surface voids or bugholes frequently appearing on concrete surface after the casting process make the corresponding manual inspection time consuming, costly, labor intensive, and inconsistent. In order to make a better inspection of the concrete surface, automatic classification of concrete bugholes is needed. In this paper, a variable selection strategy is proposed for pursuing feature interpretability, together with an automatic ensemble classification designed for getting a better accuracy of the bughole classification. A texture feature deriving from the Gabor filter and gray-level run lengths is extracted in concrete surface images. Interpretable variables, which are also the components of the feature, are selected according to a presented cumulative voting strategy. An ensemble classifier with its base classifier automatically assigned is provided to detect whether a surface void exists in an image or not. Experimental results on 1000 image samples indicate the effectiveness of our method with a comparable prediction accuracy and model explicable.

Background: The analysis of retinal images can help to detect retinal abnormalities that are caused by cardiovascular and retinal disorders. Objective: In this paper, we propose methods based on texture features for mining and analyzing information from retinal images. Methods: The recognition of the retinal mask region is a prerequisite for retinal image processing. However, there is no way to automatically recognize the retinal region. By quantifying and analyzing texture features, a method is proposed to automatically identify the retinal region. The boundary of the circular retinal region is detected based on the image texture contrast feature, followed by the filling of the closed circular area, and then the detected circular retinal mask region can be obtained. Results: The experimental results show that the method based on the image contrast feature can be used to detect the retinal region automatically. The average accuracy of retinal mask region detection of images from the Digital Retinal Images for Vessel Extraction (DRIVE) database was 99.34%. Conclusion: This is the first time these texture features of retinal images are analyzed, and texture features are used to recognize the circular retinal region automatically.

This paper presents a scientific foundation for automated stroke severity classification. We have constructed and assessed a system which extracts diagnostically relevant information from Magnetic Resonance Imaging (MRI) images. The design was based on 267 images that show the brain from individual subjects after stroke. They were labeled as either Lacunar Syndrome (LACS), Partial Anterior Circulation Syndrome (PACS), or Total Anterior Circulation Stroke (TACS). The labels indicate different physiological processes which manifest themselves in distinct image texture. The processing system was tasked with extracting texture information that could be used to classify a brain MRI image from a stroke survivor into either LACS, PACS, or TACS. We analyzed 6475 features that were obtained with Gray-Level Run Length Matrix (GLRLM), Higher Order Spectra (HOS), as well as a combination of Discrete Wavelet Transform (DWT) and Gray-Level Co-occurrence Matrix (GLCM) methods. The resulting features were ranked based on the p-value extracted with the Analysis Of Variance (ANOVA) algorithm. The ranked features were used to train and test four types of Support Vector Machine (SVM) classification algorithms according to the rules of 10-fold cross-validation. We found that SVM with Radial Basis Function (RBF) kernel achieves: Accuracy (ACC) = 93.62%, Specificity (SPE) = 95.91%, Sensitivity (SEN) = 92.44%, and Dice-score = 0.95. These results indicate that computer aided stroke severity diagnosis support is possible. Such systems might lead to progress in stroke diagnosis by enabling healthcare professionals to improve diagnosis and management of stroke patients with the same resources.

Evaluating the susceptibility of regional landslides is one of the core steps in spatial landslide prediction. Starting from multiresolution image segmentation and object-oriented classification theory, this paper uses the four parameters of entropy, energy, correlation, and contrast from remote-sensing images in the Zigui&ndash, Badong section of Three Gorges Reservoir as image texture factors, the original image data for the study area were divided into 2279 objects after segmentation. According to the various indicators of the existing historical landslide database in the Three Gorges Reservoir area, combined with the classification processing steps for different types of multistructured data, the relevant geological evaluation factors, including the slope gradient, slope structure, and engineering rock group, were rated based on expert experience. From the perspective of the object-oriented segmentation of multiresolution images and geological factor rating classification, the C5.0 decision tree susceptibility classification model was constructed for the prediction of four types of landslide susceptibility units in the Zigui&ndash, Badong section. The mapping results show that the engineering rock group of a high-susceptibility unit usually develops in soft rock or soft&ndash, hard interphase rock groups, and the slope is between 15&deg, &ndash, 30&deg, The model results show that the average accuracy is 91.64%, and the kappa coefficients are 0.84 and 0.51, indicating that the C5.0 decision tree algorithm provides good accuracy and can clearly divide landslide susceptibility levels for a specific area, respectively. This landslide susceptibility classification, based on multiresolution image segmentation and geological factor classification, has potential applicability.

Bilateral filters have been extensively utilized in a number of image denoising applications such as segmentation, registration, and tissue classification. However, it requires burdensome adjustments of the filter parameters to achieve the best performance for each individual image. To address this problem, this paper proposes a computer-aided parameter decision system based on image texture features associated with neural networks. In our approach, parallel computing with the GPU architecture is first developed to accelerate the computation of the conventional bilateral filter. Subsequently, a back propagation network (BPN) scheme using significant image texture features as the input is established to estimate the GPU-based bilateral filter parameters and its denoising process. The k-fold cross validation method is exploited to evaluate the performance of the proposed automatic restoration framework. A wide variety of T1-weighted brain MR images were employed to train and evaluate this parameter-free decision system with GPU-based bilateral filtering, which resulted in a speed-up factor of 208 comparing to the CPU-based computation. The proposed filter parameter prediction system achieved a mean absolute percentage error (MAPE) of 6% and was classified as “high accuracy”. Our automatic denoising framework dramatically removed noise in numerous brain MR images and outperformed several state-of-the-art methods based on the peak signal-to-noise ratio (PSNR). The usage of image texture features associated with the BPN to estimate the GPU-based bilateral filter parameters and to automate the denoising process is feasible and validated. It is suggested that this automatic restoration system is advantageous to various brain MR image-processing applications.

In the field of pathology, whole slide image (WSI) has become the major carrier of visual and diagnostic information. Content-based image retrieval among WSIs can aid the diagnosis of an unknown pathological image by finding its similar regions in WSIs with diagnostic information. However, the huge size and complex content of WSI pose several challenges for retrieval. In this paper, we propose an unsupervised, accurate, and fast retrieval method for a breast histopathological image. Specifically, the method presents a local statistical feature of nuclei for morphology and distribution of nuclei, and employs the Gabor feature to describe the texture information. The latent Dirichlet allocation model is utilized for high-level semantic mining. Locality-sensitive hashing is used to speed up the search. Experiments on a WSI database with more than 8000 images from 15 types of breast histopathology demonstrate that our method achieves about 0.9 retrieval precision as well as promising efficiency. Based on the proposed framework, we are developing a search engine for an online digital slide browsing and retrieval platform, which can be applied in computer-aided diagnosis, pathology education, and WSI archiving and management.

Similarity is one of the key processes of DNA sequence analysis in computational biology and bioinformatics. In nearly all research that explores evolutionary relationships, gene function analysis, protein structure prediction and sequence retrieving, it is necessary to perform similarity calculations. One major task in alignment-free DNA sequence similarity calculations is to develop novel mathematical descriptors for DNA sequences. In this paper, we present a novel approach to DNA sequence similarity analysis studies using similarity calculations of texture images. Texture analysis methods, which are a subset of digital image processing methods, are used here with the assumption that these calculations can be adapted to alignment-free DNA sequence similarity analysis methods. Gray-level textures were created by the values assigned to the nucleotides in the DNA sequences. Similarity calculations were made between these textures using histogram-based texture analyses based on first-order statistics. We obtained texture features for 3 different DNA data sets of different lengths, and calculated the similarity matrices. The phylogenetic relationships revealed by our method shows our trees to be similar to the results of the MEGA software, which is based on sequence alignment. Our findings show that texture analysis metrics can be used to characterize DNA sequences.

The image representation plays an important role in compressed sensing magnetic resonance imaging (CSMRI). However, how to adaptive sparsely represent images is a challenge for accurately reconstructing magnetic resonance (MR) images from highly undersampled data with noise. In order to further improve the reconstruction quality of the MR image, this paper first proposes tight frame-based group sparsity (TFGS) regularization that can capture the structure information of images appropriately, then TFGS regularization is employed to the image cartoon-texture decomposition model to construct CSMRI algorithm, termed cartoon-texture decomposition CSMRI algorithm (CD-MRI). CD-MRI effectively integrates the total variation and TFGS regularization into the image cartoon-texture decomposition framework, and utilizes the sparse priors of image cartoon and texture components to reconstruct MR images. Virtually, CD-MRI exploits the global sparse representations of image cartoon components by the total variation regularization, and explores group sparse representations of image texture components via the adaptive tight frame learning technique and group sparsity regularization. The alternating iterative method combining with the majorization-minimization algorithm is applied to solve the formulated optimization problem. Finally, simulation experiments demonstrate that the proposed algorithm can achieve high-quality MR image reconstruction from undersampled K-space data, and can remove noise in different sampling schemes. Compared to the previous CSMRI algorithms, the proposed approach can lead to better image reconstruction performance and better robustness to noise.

This paper presents a new supervised method for vessel segmentation in retinal images. This method remolds the task of segmentation as a problem of cross-modality data transformation from retinal image to vessel map. A wide and deep neural network with strong induction ability is proposed to model the transformation, and an efficient training strategy is presented. Instead of a single label of the center pixel, the network can output the label map of all pixels for a given image patch. Our approach outperforms reported state-of-the-art methods in terms of sensitivity, specificity and accuracy. The result of cross-training evaluation indicates its robustness to the training set. The approach needs no artificially designed feature and no preprocessing step, reducing the impact of subjective factors. The proposed method has the potential for application in image diagnosis of ophthalmologic diseases, and it may provide a new, general, high-performance computing framework for image segmentation.

Optical coherence tomography (OCT) imaging plays an important role in clinical diagnosis and monitoring of diseases of the human retina. Automated analysis of optical coherence tomography images is a challenging task as the images are inherently noisy. In this paper, a novel variational image decomposition model is proposed to decompose an OCT image into three components: the first component is the original image but with the noise completely removed; the second contains the set of edges representing the retinal layer boundaries present in the image; and the third is an image of noise, or in image decomposition terms, the texture, or oscillatory patterns of the original image. In addition, a fast Fourier transform based split Bregman algorithm is developed to improve computational efficiency of solving the proposed model. Extensive experiments are conducted on both synthesised and real OCT images to demonstrate that the proposed model outperforms the state-of-the-art speckle noise reduction methods and leads to accurate retinal layer segmentation.

Multiview face recognition has become an active research area in the last few years. In this paper, we present an approach for video-based face recognition in camera networks. Our goal is to handle pose variations by exploiting the redundancy in the multiview video data. However, unlike traditional approaches that explicitly estimate the pose of the face, we propose a novel feature for robust face recognition in the presence of diffuse lighting and pose variations. The proposed feature is developed using the spherical harmonic representation of the face texture-mapped onto a sphere; the texture map itself is generated by back-projecting the multiview video data. Video plays an important role in this scenario. First, it provides an automatic and efficient way for feature extraction. Second, the data redundancy renders the recognition algorithm more robust. We measure the similarity between feature sets from different videos using the reproducing kernel Hilbert space. We demonstrate that the proposed approach outperforms traditional algorithms on a multiview video database.

Ulcer is one of the most common symptoms of many serious diseases in the human digestive tract. Especially for the ulcers in the small bowel where other procedures cannot adequately visualize, wireless capsule endoscopy (WCE) is increasingly being used in the diagnosis and clinical management. Because WCE generates large amount of images from the whole process of inspection, computer-aided detection of ulcer is considered an indispensable relief to clinicians. In this paper, a two-staged fully automated computer-aided detection system is proposed to detect ulcer from WCE images. In the first stage, we propose an effective saliency detection method based on multi-level superpixel representation to outline the ulcer candidates. To find the perceptually and semantically meaningful salient regions, we first segment the image into multi-level superpixel segmentations. Each level corresponds to different initial region sizes of the superpixels. Then we evaluate the corresponding saliency according to the color and texture features in superpixel region of each level. In the end, we fuse the saliency maps from all levels together to obtain the final saliency map. In the second stage, we apply the obtained saliency map to better encode the image features for the ulcer image recognition tasks. Because the ulcer mainly corresponds to the saliency region, we propose a saliency max-pooling method integrated with the Locality-constrained Linear Coding (LLC) method to characterize the images. Experiment results achieve promising 92.65% accuracy and 94.12% sensitivity, validating the effectiveness of the proposed method. Moreover, the comparison results show that our detection system outperforms the state-of-the-art methods on the ulcer classification task.

This paper proposes a new texture enhancement method which uses an image decomposition that allows different visual characteristics of textures to be represented by separate components in contrast with previous methods which either enhance texture indirectly or represent all texture information using a single image component. Our method is intended to be used as a preprocessing step prior to the use of texture-based image segmentation algorithms. Our method uses a modification of morphological component analysis (MCA) which allows texture to be separated into multiple morphological components each representing a different visual characteristic of texture. We select four such texture characteristics and propose new dictionaries to extract these components using MCA. We then propose procedures for modifying each texture component and recombining them to produce a texture-enhanced image. We applied our method as a preprocessing step prior to a number of texture-based segmentation methods and compared the accuracy of the results, finding that our method produced results superior to comparator methods for all segmentation algorithms tested. We also demonstrate by example the main mechanism by which our method produces superior results, namely that it causes the clusters of local texture features of each distinct image texture to mutually diverge within the multidimensional feature space to a vastly superior degree versus the comparator enhancement methods.

Distinctive feature detection is an essential task in computer-assisted minimally invasive surgery (MIS). For special conditions in an MIS imaging environment, such as specular reflections and texture homogeneous areas, the feature points extracted by general feature point detectors are less distinctive and repeatable in MIS images. We observe that abundant blood vessels are available on tissue surfaces and can be extracted as a new set of image features. In this paper, two types of blood vessel features are proposed for endoscopic images: branching points and branching segments. Two novel methods, ridgeness-based circle test and ridgeness-based branching segment detection are presented to extract branching points and branching segments, respectively. Extensive in vivo experiments were conducted to evaluate the performance of the proposed methods and compare them with the state-of-the-art methods. The numerical results verify that, in MIS images, the blood vessel features can produce a large number of points. More importantly, those points are more robust and repeatable than the other types of feature points. In addition, due to the difference in feature types, vessel features can be combined with other general features, which makes them new tools for MIS image analysis. These proposed methods are efficient and the code and datasets are made available to the public.

This paper presents a fast and robust level set method for image segmentation. To enhance the robustness against noise, we embed a Markov random field (MRF) energy function to the conventional level set energy function. This MRF energy function builds the correlation of a pixel with its neighbors and encourages them to fall into the same region. To obtain a fast implementation of the MRF embedded level set model, we explore algebraic multigrid (AMG) and sparse field method (SFM) to increase the time step and decrease the computation domain, respectively. Both AMG and SFM can be conducted in a parallel fashion, which facilitates the processing of our method for big image databases. By comparing the proposed fast and robust level set method with the standard level set method and its popular variants on noisy synthetic images, synthetic aperture radar (SAR) images, medical images, and natural images, we comprehensively demonstrate the new method is robust against various kinds of noises. In particular, the new level set method can segment an image of size 500 × 500 within 3 s on MATLAB R2010b installed in a computer with 3.30-GHz CPU and 4-GB memory.

Contour tree represents the nesting relations of the individual components in the image; however, it neglects the geometric structure of the terrain. In this paper, we propose a new topological representation that provides the nesting and spatial relations of regions for CT image interpretation. The tree is constructed based on the signed distance transformation of binary CT image, and combines intensity based contour tree and a new gradient based topology tree. We also investigate the application of the topological representation as a constraint in target object segmentation. Ten non-small cell lung tumor CT studies were used for segmentation accuracy evaluation. The image representation results showed that the proposed tree structure retained the nesting and spatial relations of the tissues or objects in the CT image. The segmentation results demonstrated its usability in the separation of adjacent objects with similar intensity distributions.

Ultrasound imaging has become one of the most popular medical imaging modalities with numerous diagnostic applications. However, ultrasound (US) image segmentation, which is the essential process for further analysis, is a challenging task due to the poor image quality. In this paper, we propose a new segmentation scheme to combine both region- and edge-based information into the robust graph-based (RGB) segmentation method. The only interaction required is to select two diagonal points to determine a region of interest (ROI) on the original image. The ROI image is smoothed by a bilateral filter and then contrast-enhanced by histogram equalization. Then, the enhanced image is filtered by pyramid mean shift to improve homogeneity. With the optimization of particle swarm optimization (PSO) algorithm, the RGB segmentation method is performed to segment the filtered image. The segmentation results of our method have been compared with the corresponding results obtained by three existing approaches, and four metrics have been used to measure the segmentation performance. The experimental results show that the method achieves the best overall performance and gets the lowest ARE (10.77%), the second highest TPVF (85.34%), and the second lowest FPVF (4.48%).

Similarity measurement of lung nodules is a critical component in content-based image retrieval (CBIR), which can be useful in differentiating between benign and malignant lung nodules on computer tomography (CT). This paper proposes a new two-step CBIR scheme (TSCBIR) for computer-aided diagnosis of lung nodules. Two similarity metrics, semantic relevance and visual similarity, are introduced to measure the similarity of different nodules. The first step is to search for K most similar reference ROIs for each queried ROI with the semantic relevance metric. The second step is to weight each retrieved ROI based on its visual similarity to the queried ROI. The probability is computed to predict the likelihood of the queried ROI depicting a malignant lesion. In order to verify the feasibility of the proposed algorithm, a lung nodule dataset including 366 nodule regions of interest (ROIs) is assembled from LIDC-IDRI lung images on CT scans. Three groups of texture features are implemented to represent a nodule ROI. Our experimental results on the assembled lung nodule dataset show good performance improvement over existing popular classifiers.

This paper presents a method for automatic segmentation of nuclei in phase-contrast images using the intensity, convexity and texture of the nuclei. The proposed method consists of three main stages: preprocessing, h-maxima transformation-based marker controlled watershed segmentation ( h-TMC), and texture analysis. In the preprocessing stage, a top-hat filter is used to increase the contrast and suppress the non-uniform illumination, shading, and other imaging artifacts in the input image. The nuclei segmentation stage consists of a distance transformation, h-maxima transformation and watershed segmentation. These transformations utilize the intensity information and the convexity property of the nucleus for the purpose of detecting a single marker in every nucleus; these markers are then used in the h-TMC watershed algorithm to obtain segments of the nuclei. However, dust particles, imaging artifacts, or prolonged cell cytoplasm may falsely be segmented as nuclei at this stage, and thus may lead to an inaccurate analysis of the cell image. In order to identify and remove these non-nuclei segments, in the third stage a texture analysis is performed, that uses six of the Haralick measures along with the AdaBoost algorithm. The novelty of the proposed method is that it introduces a systematic framework that utilizes intensity, convexity, and texture information to achieve a high accuracy for automatic segmentation of nuclei in the phase-contrast images. Extensive experiments are performed demonstrating the superior performance ( precision = 0.948; recall = 0.924; F1-measure = 0.936; validation based on ∼ 4850 manually-labeled nuclei) of the proposed method.

In this paper, region-difference filters for the segmentation of liver ultrasound (US) images are proposed. Region-difference filters evaluate maximum difference of the average of two regions of the window around the center pixel. Implementing the filters on the whole image gives region-difference image. This image is then converted into binary image and morphologically operated for segmenting the desired lesion from the ultrasound image. The proposed method is compared with the maximum a posteriori-Markov random field (MAP-MRF), Chan-Vese active contour method (CV-ACM), and active contour region-scalable fitting energy (RSFE) methods. MATLAB code available online for the RSFE method is used for comparison whereas MAP-MRF and CV-ACM methods are coded in MATLAB by authors. Since no comparison is available on common database for the performance of the three methods, therefore, performance comparison of the three methods and proposed method was done on liver US images obtained from PGIMER, Chandigarh, India and from online resource. A radiologist blindly analyzed segmentation results of the 4 methods implemented on 56 images and had selected the segmentation result obtained from the proposed method as best for 46 test US images. For the remaining 10 US images, the proposed method performance was very near to the other three segmentation methods. The proposed segmentation method obtained the overall accuracy of 99.32% in comparison to the overall accuracy of 85.9, 98.71, and 68.21% obtained by MAP-MRF, CV-ACM, and RSFE methods, respectively. Computational time taken by the proposed method is 5.05 s compared to the time of 26.44, 24.82, and 28.36 s taken by MAP-MRF, CV-ACM, and RSFE methods, respectively.

Segmentation of the arterial wall boundaries from intravascular ultrasound images is an important image processing task in order to quantify arterial wall characteristics such as shape, area, thickness and eccentricity. Since manual segmentation of these boundaries is a laborious and time consuming procedure, many researchers attempted to develop (semi-) automatic segmentation techniques as a powerful tool for educational and clinical purposes in the past but as yet there is no any clinically approved method in the market. This paper presents a deterministic-statistical strategy for automatic media-adventitia border detection by a fourfold algorithm. First, a smoothed initial contour is extracted based on the classification in the sparse representation framework which is combined with the dynamic directional convolution vector field. Next, an active contour model is utilized for the propagation of the initial contour toward the interested borders. Finally, the extracted contour is refined in the leakage, side branch openings and calcification regions based on the image texture patterns. The performance of the proposed algorithm is evaluated by comparing the results to those manually traced borders by an expert on 312 different IVUS images obtained from four different patients. The statistical analysis of the results demonstrates the efficiency of the proposed method in the media-adventitia border detection with enough consistency in the leakage and calcification regions. IVUS images segmentation is an essential task for clinical applications.Media-adventitia (MA) border describes vessel features like shape and eccentricity.A fourfold automatic segmentation method for MA border extraction is proposed.It is based on the sparse classification and dynamic directional active contour model.The results show the efficiency of the proposed method in MA border extraction from IVUS images.

Although current 3D scanner technology can acquire textural images from a point model, visible seams in the image, inconvenient data acquisition and occupancy of a large space during use are points of concern for outdoor fruit models. In this paper, an SPSDW (simplification and perception based subdivision followed by down-sampling weighted average) method is proposed to balance memory usage and texture synthesis quality using a crop fruit, such as apples, as a research subject for a point-based fruit model. First, the quadtree method is improved to make splitting more efficient, and a reasonable texton descriptor is defined to promote query efficiency. Then, the color perception feature is extracted from the image for all pixels. Next, an advanced sub-division scheme and down-sampling strategy are designed to optimize memory space. Finally, a weighted oversampling method is proposed for high-quality texture mixing. This experiment demonstrates that the SPSDW method preserves the mixed texture more realistically and smoothly and preserves color memory up to 94%, 84.7% and 85.7% better than the two-dimesional processing, truncating scalar quantitative and color vision model methods, respectively.

This paper presents a novel fully automatic framework for multi-class brain tumor classification and segmentation using a sparse coding and dictionary learning method. The proposed framework consists of two steps: classification and segmentation. The classification of the brain tumors is based on brain topology and texture. The segmentation is based on voxel values of the image data. Using K-SVD, two types of dictionaries are learned from the training data and their associated ground truth segmentation: feature dictionary and voxel-wise coupled dictionaries. The feature dictionary consists of global image features (topological and texture features). The coupled dictionaries consist of coupled information: gray scale voxel values of the training image data and their associated label voxel values of the ground truth segmentation of the training data. For quantitative evaluation, the proposed framework is evaluated using different metrics. The segmentation results of the brain tumor segmentation (MICCAI-BraTS-2013) database are evaluated using five different metric scores, which are computed using the online evaluation tool provided by the BraTS-2013 challenge organizers. Experimental results demonstrate that the proposed approach achieves an accurate brain tumor classification and segmentation and outperforms the state-of-the-art methods.

Indirect immunofluorescence imaging of human epithelial type 2 (HEp-2) cell image is an effective evidence to diagnose autoimmune diseases. Recently, computer-aided diagnosis of autoimmune diseases by the HEp-2 cell classification has attracted great attention. However, the HEp-2 cell classification task is quite challenging due to large intraclass and small interclass variations. In this paper, we propose an effective approach for the automatic HEp-2 cell classification by combining multiresolution co-occurrence texture and large regional shape information. To be more specific, we propose to: 1) capture multiresolution co-occurrence texture information by a novel pairwise rotation-invariant co-occurrence of local Gabor binary pattern descriptor; 2) depict large regional shape information by using an improved Fisher vector model with RootSIFT features, which are sampled from large image patches in multiple scales; and 3) combine both features. We evaluate systematically the proposed approach on the IEEE International Conference on Pattern Recognition (ICPR) 2012, the IEEE International Conference on Image Processing (ICIP) 2013, and the ICPR 2014 contest datasets. The proposed method based on the combination of the introduced two features outperforms the winners of the ICPR 2012 contest using the same experimental protocol. Our method also greatly improves the winner of the ICIP 2013 contest under four different experimental setups. Using the leave-one-specimen-out evaluation strategy, our method achieves comparable performance with the winner of the ICPR 2014 contest that combined four features.

This paper presents a new active contour segmentation model using a level set function that can correctly capture both the strong and the weak boundaries of a target enclosed by bright and dark regions at the same time. We introduce an enhanced image obtained from prior information about the intensity of the target. The enhanced image emphasizes the regions where pixels have intensities close to the prior intensity. This enables a desirable segmentation of an image having a partially low contrast with the target surrounded by regions that are brighter or darker than the target. We define an edge indicator function on an original image, and local and regularization forces on an enhanced image. An edge indicator function and two forces are incorporated in order to identify the strong and weak boundaries, respectively. We established an evolution equation of contours in the level set formulation and experimented with several medical images to show the performance of the proposed method.

Computer-aided detection (CAD) systems are being increasingly deployed for medical applications in recent years with the goal to speed up tedious tasks and improve precision. Among others, segmentation is an important component in CAD systems as a preprocessing step to help recognize patterns in medical images. In order to assess the accuracy of a CAD segmentation algorithm, comparison with ground truth data is necessary. To-date, ground truth delineation relies mainly on contours that are either manually defined by clinical experts or automatically generated by software. In this paper, we propose a systematic ground truth delineation method based on a Local Consistency Set Analysis approach, which can be used to establish an accurate ground truth representation, or if ground truth is available, to assess the accuracy of a CAD generated segmentation algorithm. We validate our computational model using medical data. Experimental results demonstrate the robustness of our approach. In contrast to current methods, our model also provides consistency information at distributed boundary pixel level, and thus is invariant to global compensation error.

Segmentation of regions of interest is a well-known problem in image segmentation. This paper presents a region-based image segmentation technique using active contours with signed pressure force (SPF) function. The proposed algorithm contemporaneously traces high intensity or dense regions in an image by evolving the contour inwards. In medical image modalities these high intensity or dense regions refer to tumor, masses, or dense tissues. The proposed method partitions an image into an arbitrary number of subregions and tracks down salient regions step by step. It is implemented by enforcing a new region-based SPF function in a traditional edge-based level set model. It partitions an image into subregions and then discards outer subregion and partitions inner region into two more subregions; this continues iteratively until a stopping condition is fulfilled. A Gaussian kernel is used to regularize the level set function, which not only regularizes it but also removes the need of computationally expensive reinitialization. The proposed segmentation algorithm has been applied to different images in order to demonstrate the accuracy, effectiveness, and robustness of the algorithm.

Blur is a key determinant in the perception of image quality. Generally, blur causes spread of edges, which leads to shape changes in images. Discrete orthogonal moments have been widely studied as effective shape descriptors. Intuitively, blur can be represented using discrete moments since noticeable blur affects the magnitudes of moments of an image. With this consideration, this paper presents a blind image blur evaluation algorithm based on discrete Tchebichef moments. The gradient of a blurred image is first computed to account for the shape, which is more effective for blur representation. Then the gradient image is divided into equal-size blocks and the Tchebichef moments are calculated to characterize image shape. The energy of a block is computed as the sum of squared non-DC moment values. Finally, the proposed image blur score is defined as the variance-normalized moment energy, which is computed with the guidance of a visual saliency model to adapt to the characteristic of human visual system. The performance of the proposed method is evaluated on four public image quality databases. The experimental results demonstrate that our method can produce blur scores highly consistent with subjective evaluations. It also outperforms the state-of-the-art image blur metrics and several general-purpose no-reference quality metrics.

Cataloged from PDF version of article. In digital pathology, devising effective image representations is crucial to design robust automated diagnosis systems. To this end, many studies have proposed to develop object-based representations, instead of directly using image pixels, since a histopathological image may contain a considerable amount of noise typically at the pixel-level. These previous studies mostly employ color information to define their objects, which approximately represent histological tissue components in an image, and then use the spatial distribution of these objects for image representation and classification. Thus, object definition has a direct effect on the way of representing the image, which in turn affects classification accuracies. In this paper, our aim is to design a classification system for histopathological images. Towards this end, we present a new model for effective representation of these images that will be used by the classification system. The contributions of this model are twofold. First, it introduces a new two-tier tissue decomposition method for defining a set of multityped objects in an image. Different than the previous studies, these objects are defined combining texture, shape, and size information and they may correspond to individual histological tissue components as well as local tissue subregions of different characteristics. As its second contribution, it defines a new metric, which we call dominant blob scale, to characterize the shape and size of an object with a single scalar value. Our experiments on colon tissue images reveal that this new object definition and characterization provides distinguishing representation of normal and cancerous histopathological images, which is effective to obtain more accurate classification results compared to its counterparts.

Image segmentation remains an important, but hard-to-solve, problem since it appears to be application dependent with usually no a priori information available regarding the image structure. In recent years, many image segmentation algorithms have been developed, but they are often very complex and some undesired results occur frequently. In this paper, we propose a pixel classification based color image segmentation using quaternion exponent moments. Firstly, the pixel-level image feature is extracted based on quaternion exponent moments (QEMs), which can capture effectively the image pixel content by considering the correlation between different color channels. Then, the pixel-level image feature is used as input of twin support vector machines (TSVM) classifier, and the TSVM model is trained by selecting the training samples with Arimoto entropy thresholding. Finally, the color image is segmented with the trained TSVM model. The proposed scheme has the following advantages: (1) the effective QEMs is introduced to describe color image pixel content, which considers the correlation between different color channels, (2) the excellent TSVM classifier is utilized, which has lower computation time and higher classification accuracy. Experimental results show that our proposed method has very promising segmentation performance compared with the state-of-the-art segmentation approaches recently proposed in the literature.

Recent investigations on human vision discover that the retinal image is a landscape or a geometric surface, consisting of features such as ridges and summits. However, most of existing popular local image descriptors in the literature, e.g., scale invariant feature transform (SIFT), histogram of oriented gradient (HOG), DAISY, local binary Patterns (LBP), and gradient location and orientation histogram, only employ the first-order gradient information related to the slope and the elasticity, i.e., length, area, and so on of a surface, and thereby partially characterize the geometric properties of a landscape. In this paper, we introduce a novel and powerful local image descriptor that extracts the histograms of second-order gradients (HSOGs) to capture the curvature related geometric properties of the neural landscape, i.e., cliffs, ridges, summits, valleys, basins, and so on. We conduct comprehensive experiments on three different applications, including the problem of local image matching, visual object categorization, and scene classification. The experimental results clearly evidence the discriminative power of HSOG as compared with its first-order gradient-based counterparts, e.g., SIFT, HOG, DAISY, and center-symmetric LBP, and the complementarity in terms of image representation, demonstrating the effectiveness of the proposed local descriptor.