Search

To evaluate the effect of specific nursing intervention in children with mycoplasma pneumonia (MP), a feature extraction algorithm based on gray level co-occurrence matrix (GLCM) was proposed and combined with computed tomography (CT) image texture features. Then, 98 children with MP were rolled into the observation group with 49 cases (specific nursing) and the control group with 49 cases (routine nursing). CT images based on feature extraction algorithm of optimized GLCM were used to examine the children before and after nursing intervention, and the recovery of the two groups of children was discussed. The results showed that the proportion of lung texture increase, rope shadow, ground glass shadow, atelectasis, and pleural effusion in the observation group (24.11%, 3.86%, 8.53%, 15.03%, and 3.74%) was significantly lower than that in the control group (28.53%, 10.23%, 13.34%, 21.15%, and 8.13%) after nursing ( P < 0.05 ). There were no significant differences in the proportion of small patchy shadows, large patchy consolidation shadows, and bronchiectasis between the observation group and the control group ( P > 0.05 ). In the course of nursing intervention, in the observation group, the disappearance time of cough, normal temperature, disappearance time of lung rales, and absorption time of lung shadow (2.15 ± 0.86 days, 4.81 ± 1.14 days, 3.64 ± 0.55 days, and 5.96 ± 0.62 days) were significantly shorter than those in the control group (2.87 ± 0.95 days, 3.95 ± 1.06 days, 4.51 ± 1.02 days, and 8.14 ± 1.35 days) ( P < 0.05 ). After nursing intervention, the proportion of satisfaction and total satisfaction in the experimental group (67.08% and 28.66%) was significantly higher than that in the control group (40.21% and 47.39%), while the proportion of dissatisfaction (4.26%) was significantly lower than that in the control group (12.4%) ( P < 0.05 ). To sum up, specific nursing intervention was more beneficial to improve the progress of characterization recovery and the overall recovery effect of children with MP relative to conventional nursing. CT image based on feature extraction algorithm of optimized GLCM was of good adoption value in the diagnosis and treatment of MP in children.

The Haralick texture features are common in the image analysis literature, partly because of their simplicity and because their values can be interpreted. It was recently observed that the Haralick texture features are very sensitive to the size of the GLCM that was used to compute them, which led to a new formulation that is invariant to the GLCM size. However, these new features still depend on the sample size used to compute the GLCM, i.e. the size of the input image region-of-interest (ROI). The purpose of this work was to investigate the performance of density estimation methods for approximating the GLCM and subsequently the corresponding invariant features. Three density estimation methods were evaluated, namely a piece-wise constant distribution, the Parzen-windows method, and the Gaussian mixture model. The methods were evaluated on 29 different image textures and 20 invariant Haralick texture features as well as a wide range of different ROI sizes. The results indicate that there are two types of features: those that have a clear minimum error for a particular GLCM size for each ROI size, and those whose error decreases monotonically with increased GLCM size. For the first type of features, the Gaussian mixture model gave the smallest errors, and in particular for small ROI sizes (less than about [Formula: see text]). In conclusion, the Gaussian mixture model is the preferred method for the first type of features (in particular for small ROIs). For the second type of features, simply using a large GLCM size is preferred.

The goal of this study was to investigate the potentials of cooccurrence matrix analysis for the characterization of echographic image texture. Echographic data were obtained by one-dimensional simulations. Various data sets were generated with different number densities of the randomly distributed scatterers and with different levels of structural scattering strength. Cooccurrence matrix parameters estimated for analysis were: angular second moment, contrast, correlation, entropy and kappa. The cooccurrence matrix analysis was tuned by varying its parameters: spatial displacement of the pixel pairs, number of gray levels and size of the window. The parameters reached a saturation level at a number density of 3-5 scatterers per resolution cell (-6 dB width). Similarly, when increasing the displacement, a limit value was reached at 4-20 samples, depending on the size of the resolution cell. Using the Mahalanobis distance as a measure of differentiating between two textures, a systematic inverse relation was observed between the size of the window and the number of gray levels used in the estimation of the cooccurrence matrix. The optimal parameters to differentiate textures without structure appeared to be entropy and angular second moment. A window size of 90 speckle cells and 64 gray levels is needed for this purpose. The effective speckle size was estimated from the mean number of maxima of the demodulated echo signals. Resolved structure results in a periodicity of parameter values with displacement. The periodicity can be calculated by changing the displacement d. Optimal parameters for detecting periodicity are contrast and correlation. Analysis of the correlation between parameters showed that entropy vs. angular second moment and contrast vs. correlation are highly correlated.

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.

BACKGROUND AND PURPOSE: Iterative reconstruction has promise in lowering the radiation dose without compromising image quality, but its full potential has not yet been realized. While phantom studies cannot fully approximate the subjective effects on image quality, live animal models afford this assessment. We characterize dose reduction in head CT by applying advanced modeled iterative reconstruction (ADMIRE) in a live ovine model while evaluating preservation of gray-white matter detectability and image texture compared with filtered back-projection. MATERIALS AND METHODS: A live sheep was scanned on a Force CT scanner (Siemens) at 12 dose levels (82–982 effective mAs). Images were reconstructed with filtered back-projection and ADMIRE (strengths, 1–5). A total of 72 combinations (12 doses × 6 reconstructions) were evaluated qualitatively for resemblance to the reference image (highest dose with filtered back-projection) using 2 metrics: detectability of gray-white matter differentiation and noise-versus-smoothness in image texture. Quantitative analysis for noise, SNR, and contrast-to-noise was also performed across all dose-strength combinations. RESULTS: Both qualitative and quantitative results confirm that gray-white matter differentiation suffers at a lower dose but recovers when complemented by higher iterative reconstruction strength, and image texture acquires excessive smoothness with a higher iterative reconstruction strength but recovers when complemented by dose reduction. Image quality equivalent to the reference image is achieved by a 58% dose reduction with ADMIRE-5. CONCLUSIONS: An approximately 60% dose reduction may be possible while preserving diagnostic quality with the appropriate dose-strength combination. This in vivo study can serve as a useful guide for translating the full implementation of iterative reconstruction in clinical practice.

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.

Purpose Image texture is increasingly used to discriminate tissues and lesions in PET/CT. For quantification or in computer-aided diagnosis, textural feature analysis must produce robust and comparable values. Because statistical feature values depend on image count statistics, we investigated in depth the stability of Haralick features values as functions of acquisition duration, and for common image resolutions and reconstructions. Methods A homogeneous cylindrical phantom containing 9.6 kBq/ml Ge-68 was repeatedly imaged on a Siemens Biograph mCT, with acquisition durations ranging from three seconds to three hours. Images with 1.5, 2, and 4 mm isometrically spaced voxels were reconstructed with filtered back-projection (FBP), ordered subset expectation maximization (OSEM), and the Siemens TrueX algorithm. We analysed Haralick features derived from differently quantized (3 to 8-bit) grey level co-occurrence matrices (GLCMs) as functions of exposure E, which we defined as the product of activity concentration in a volume of interest (VOI) and acquisition duration. The VOI was a 50 mm wide cube at the centre of the phantom. Feature stability was defined for df/dE → 0. Results The most stable feature values occurred in low resolution FBPs, whereas some feature values from 1.5 mm TrueX reconstructions ranged over two orders of magnitude. Within the same reconstructions, most feature value-exposure curves reached stable plateaus at similar exposures, regardless of GLCM quantization. With 8-bit GLCM, median time to stability was 16 s and 22 s for FBPs, 18 s and 125 s for OSEM, and 23 s, 45 s, and 76 s for PSF reconstructions, with longer durations for higher resolutions. Stable exposures coincided in OSEM and TrueX reconstructions with image noise distributions converging to a Gaussian. In FBP, the occurrence of stable values coincided the disappearance of negatives image values in the VOI. Conclusions Haralick feature values depend strongly on exposure, but invariance exists within defined domains of exposure. Here, we present an easily replicable procedure to identify said stable exposure domains, where image noise does not substantially add to textural feature values. Only by imaging at predetermined feature-invariant exposure levels and by adjusting exposure to expected activity concentrations, can textural features have a quantitative use in PET/CT. The necessary exposure levels are attainable by modern PET/CT systems in clinical routine.

International audience; Within the last decade, several approaches using quaternion numbers to handle and model multiband images in a holistic manner were introduced. The qua-ternion Fourier transform can be efficiently used to model texture in multidimen-sional data such as color images. For practical application, multispectral satellite data appear as a primary source for measuring past trends and monitoring changes in forest carbon stocks. In this work, we propose a texture-color descriptor based on the quaternion Fourier transform to extract relevant information from multiband satellite images. We propose a new multiband image texture model extraction, called FOTO++, in order to address biomass estimation issues. The first stage consists in removing noise from the multispectral data while preserving the edges of canopies. Afterward, color texture descriptors are extracted thanks to a discrete form of the quaternion Fourier transform, and finally the support vector regression method is used to deduce biomass estimation from texture indices. Our texture features are modeled using a vector composed with the radial spectrum coming from the amplitude of the quaternion Fourier transform. We conduct several experiments in order to study the sensitivity of our model to acquisition parameters. We also assess its performance both on synthetic images and on real multispectral images of Cameroo-nian forest. The results show that our model is more robust to acquisition parameters than the classical Fourier Texture Ordination model (FOTO). Our scheme is also more accurate for aboveground biomass estimation. We stress that a similar methodology could be implemented using quaternion wavelets. These results highlight the potential of the quaternion-based approach to study multispectral satellite images.

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 order to improve the recognition rate of hand gestures a new interactive image segmentation method for hand gesture recognition is presented, and popular methods, e.g., Graph cut, Random walker, Interactive image segmentation using geodesic star convexity, are studied in this article. The Gaussian Mixture Model was employed for image modelling and the iteration of Expectation Maximum algorithm learns the parameters of Gaussian Mixture Model. We apply a Gibbs random field to the image segmentation and minimize the Gibbs Energy using Min-cut theorem to find the optimal segmentation. The segmentation result of our method is tested on an image dataset and compared with other methods by estimating the region accuracy and boundary accuracy. Finally five kinds of hand gestures in different backgrounds are tested on our experimental platform, and the sparse representation algorithm is used, proving that the segmentation of hand gesture images helps to improve the recognition accuracy.

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.

Background. The quantification of tumor heterogeneity with molecular images, by analyzing the local or global variation in the spatial arrangements of pixel intensity with texture analysis, possesses a great clinical potential for treatment planning and prognosis. To address the lack of available software for computing the tumor heterogeneity on the public domain, we develop a software package, namely, Chang-Gung Image Texture Analysis (CGITA) toolbox, and provide it to the research community as a free, open-source project.Methods. With a user-friendly graphical interface, CGITA provides users with an easy way to compute more than seventy heterogeneity indices. To test and demonstrate the usefulness of CGITA, we used a small cohort of eighteen locally advanced oral cavity (ORC) cancer patients treated with definitive radiotherapies.Results. In our case study of ORC data, we found that more than ten of the current implemented heterogeneity indices outperformed SUVmeanfor outcome prediction in the ROC analysis with a higher area under curve (AUC). Heterogeneity indices provide a better area under the curve up to 0.9 than the SUVmeanand TLG (0.6 and 0.52, resp.).Conclusions. CGITA is a free and open-source software package to quantify tumor heterogeneity from molecular images. CGITA is available for free for academic use athttp://code.google.com/p/cgita.

Texture-based analysis of images is a very common and much discussed issue in the fields of computer vision and image processing. Several methods have already been proposed to codify texture micro-patterns (texlets) in images. Most of these methods perform well when a given image is noise-free, but real world images contain different types of signal-independent as well as signal-dependent noises originated from different sources, even from the camera sensor itself. Hence, it is necessary to differentiate false textures appearing due to the noises, and thus, to achieve a reliable representation of texlets. In this proposal, we define an adaptive noise band (ANB) to approximate the amount of noise contamination around a pixel up to a certain extent. Based on this ANB, we generate reliable codes named noise tolerant ternary pattern (NTTP) to represent the texlets in an image. Extensive experiments on several datasets from renowned texture databases, such as the Outex and the Brodatz database, show that NTTP performs much better than the state-of-the-art methods.

Existing color constancy methods are all based on specific assumptions such as the spatial and spectral characteristics of images. As a consequence, no algorithm can be considered as universal. However, with the large variety of available methods, the question is how to select the method that performs best for a specific image. To achieve selection and combining of color constancy algorithms, in this paper natural image statistics are used to identify the most important characteristics of color images. Then, based on these image characteristics, the proper color constancy algorithm (or best combination of algorithms) is selected for a specific image. To capture the image characteristics, the Weibull parameterization (e.g., grain size and contrast) is used. It is shown that the Weibull parameterization is related to the image attributes to which the used color constancy methods are sensitive. An MoG-classifier is used to learn the correlation and weighting between the Weibull-parameters and the image attributes (number of edges, amount of texture, and SNR). The output of the classifier is the selection of the best performing color constancy method for a certain image. Experimental results show a large improvement over state-of-the-art single algorithms. On a data set consisting of more than 11,000 images, an increase in color constancy performance up to 20 percent (median angular error) can be obtained compared to the best-performing single algorithm. Further, it is shown that for certain scene categories, one specific color constancy algorithm can be used instead of the classifier considering several algorithms.

Glass patterns have been exhaustively studied both in the vision literature and from a purely mathematical point of view. We extend the related formalism to the continuous case and we show that continuous Glass patterns can be used for artistic imaging applications. The general idea is to replace natural texture present in an input image with synthetic painterly texture that is generated by means of a continuous Glass pattern, whose geometrical structure is controlled by the gradient orientation of the input image. The behavior of the proposed algorithm is analytically interpreted in terms of the theory of dynamical systems. Experimental results on a broad range of input images validate the effectiveness of the proposed method in terms of lack of undesired artifacts, which are present with other existing methods, and easy interpretability of the input parameters.

We consider the problem of detecting object contours in natural images. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Therefore, local edge features, which only look at a small neighborhood of each pixel, cannot be reliable indicators of the presence of a contour, and some global analysis is needed. We introduce a new morphological operator, called adaptive pseudo-dilation (APD), which uses context dependent structuring elements in order to identify long curvilinear structure in the edge map. We show that grouping edge pixels as the connected components of the output of APD results in a good agreement with the gestalt law of good continuation. The novelty of this operator is that dilation is limited to the Voronoi cell of each edge pixel. An efficient implementation of APD is presented. The grouping algorithm is then embedded in a multithreshold contour detector. At each threshold level, small groups of edges are removed, and contours are completed by means of a generalized reconstruction from markers. The use of different thresholds makes the algorithm much less sensitive to the values of the input parameters. Both qualitative and quantitative comparison with existing approaches prove the superiority of the proposed contour detector in terms of larger amount of suppressed texture and more effective detection of low-contrast contours.

Two important visual properties of paintings and painting-like images are the absence of texture details and the increased sharpness of edges as compared to photographic images. Painting-like artistic effects can be achieved from photographic images by filters that smooth out texture details, while preserving or enhancing edges and corners. However, not all edge preserving smoothers are suitable for this purpose. We present a simple nonlinear local operator that generalizes both the well known Kuwahara filter and the more general class of filters known in the literature as ldquocriterion and value filter structure.rdquo This class of operators suffers from intrinsic theoretical limitations which give rise to a dramatic instability in presence of noise, especially on shadowed areas. Such limitations are discussed in the paper and overcome by the proposed operator. A large variety of experimental results shows that the output of the proposed operator is visually similar to a painting. Comparisons with existing techniques on a large set of natural images highlight conditions on which traditional edge preserving smoothers fail, whereas our approach produces good results. In particular, unlike many other well established approaches, the proposed operator is robust to degradations of the input image such as blurring and noise contamination.

Quasi-supervised learning is a statistical learning algorithm that contrasts two datasets by computing estimate for the posterior probability of each sample in either dataset. This method has not been applied to histopathological images before. The purpose of this study is to evaluate the performance of the method to identify colorectal tissues with or without adenocarcinoma. Light microscopic digital images from histopathological sections were obtained from 30 colorectal radical surgery materials including adenocarcinoma and non-neoplastic regions. The texture features were extracted by using local histograms and co-occurrence matrices. The quasi-supervised learning algorithm operates on two datasets, one containing samples of normal tissues labelled only indirectly, and the other containing an unlabeled collection of samples of both normal and cancer tissues. As such, the algorithm eliminates the need for manually labelled samples of normal and cancer tissues for conventional supervised learning and significantly reduces the expert intervention. Several texture feature vector datasets corresponding to different extraction parameters were tested within the proposed framework. The Independent Component Analysis dimensionality reduction approach was also identified as the one improving the labelling performance evaluated in this series. In this series, the proposed method was applied to the dataset of 22,080 vectors with reduced dimensionality 119 from 132. Regions containing cancer tissue could be identified accurately having false and true positive rates up to 19% and 88% respectively without using manually labelled ground-truth datasets in a quasi-supervised strategy. The resulting labelling performances were compared to that of a conventional powerful supervised classifier using manually labelled ground-truth data. The supervised classifier results were calculated as 3.5% and 95% for the same case. The results in this series in comparison with the benchmark classifier, suggest that quasi-supervised image texture labelling may be a useful method in the analysis and classification of pathological slides but further study is required to improve the results., European Commission (PIRG03-GA-2008-230903)

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.

A novel method for finger vein pattern extraction from infrared images is presented. This method involves four steps: preprocessing which performs local normalization of the image intensity, image enhancement, image segmentation, and finally postprocessing for image cleaning. In the image enhancement step, an image which will be both smooth and similar to the original is sought. The enhanced image is obtained by minimizing the objective function of a modified separable Mumford Shah Model. Since, this minimization procedure is computationally intensive for large images, a local application of the Mumford Shah Model in small window neighborhoods is proposed. The finger veins are located in concave nonsmooth regions and, so, in order to distinct them from the other tissue parts, all the differences between the smooth neighborhoods, obtained by the local application of the model, and the corresponding windows of the original image are added. After that, veins in the enhanced image have been sufficiently emphasized. Thus, after image enhancement, an accurate segmentation can be obtained readily by a local entropy thresholding method. Finally, the resulted binary image may suffer from some misclassifications and, so, a postprocessing step is performed in order to extract a robust finger vein pattern.

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.

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.

background: The precise assessment of embryo viability is an extremely important factor for the optimization of IVF treatments. In order to assess embryo viability, several embryo scoring systems have been developed. However, they rely mostly on a subjective visual analysis of embryo morphological features and thus are subject to inter- and intra-observer variation. In this paper, we propose a method for image segmentation (the dividing of an image into its meaningful constituent regions) and classification of human blastocyst images with the aim of automating embryo grading. methods: The delineation of the boundaries (segmentation) of the zona pellucida, trophectoderm (TE) and inner cell mass (ICM) were performed using advanced image analysis techniques (level set, phase congruency and fitting of ellipse methods). The fractal dimension and mean thickness of TE and ICM image texture descriptors (texture spectrum and grey-level run lengths) were calculated to characterize the main morphological features of the blastocyst with the aim of automatic grading using Support Vector Machine classifiers. results: The fractal dimension calculated from the delineated TE boundary provided a good indication of cell number (presented a 0.81 Pearson correlation coefficient with the number of cells), a feature closely associated with blastocyst quality. The classifiers showed different accuracy levels for each grade. They presented accuracy ranges from 0.67 to 0.92 for the embryo development classification, 0.67 –0.82 for the ICM classification and 0.53 –0.92 for the TE classification. The value 0.92 was the highest accuracy achieved in the tests with 73 blastocysts. conclusions: Semi-automatic grading of human blastocysts by a computer is feasible and may offer a more precise comparison of embryos, reducing subjectivity and allowing embryos with apparently identical morphological scores to be distinguished.

Quantitative characterization of carotid atherosclerosis and classification into symptomatic or asymptomatic type is crucial in both diagnosis and treatment planning. This paper describes a computer-aided diagnosis (CAD) system which analyzes ultrasound images and classifies them into symptomatic and asymptomatic based on the textural features. The proposed CAD system consists of three modules. The first module is preprocessing, which conditions the images for the subsequent feature extraction. The feature extraction stage uses image texture analysis to calculate Standard deviation, Entropy, Symmetry, and Run Percentage. Finally, classification is performed using AdaBoost and Support Vector Machine for automated decision making. For Adaboost, we compared the performance of five distinct configurations (Least Squares, Maximum- Likelihood, Normal Density Discriminant Function, Pocket, and Stumps) of this algorithm. For Support Vector Machine, we compared the performance using five different configurations (linear kernel, polynomial kernel configurations of different orders and radial basis function kernels). SVM with radial basis function kernel for support vector machine presented the best classification result: classification accuracy of 82.4%, sensitivity of 82.9%, and specificity of 82.1%. We feel that texture features coupled with the Support Vector Machine classifier can be used to identify the plaque tissue type. An Integrated Index, called symptomatic asymptomatic carotid index (SACI), is proposed using texture features to discriminate symptomatic and asymptomatic carotid ultrasound images using just one index or number. We hope this SACI can be used as an adjunct tool by the vascular surgeons for daily screening.

Image segmentation plays an important role in medical image processing. Fuzzy c-means (FCM) is one of the popular clustering algorithms for medical image segmentation. But FCM is highly vulnerable to noise due to not considering the spatial information in image segmentation. This paper introduces medium mathematics system which is employed to process fuzzy information for image segmentation. It establishes the medium similarity measure based on the measure of medium truth degree (MMTD) and uses the correlation of the pixel and its neighbors to define the medium membership function. An improved FCM medical image segmentation algorithm based on MMTD which takes some spatial features into account is proposed in this paper. The experimental results show that the proposed algorithm is more antinoise than the standard FCM, with more certainty and less fuzziness. This will lead to its practicable and effective applications in medical image segmentation.

Line scratch detection in old films is a particularly challenging problem due to the variable spatiotemporal characteristics of this defect. Some of the main problems include sensitivity to noise and texture, and false detections due to thin vertical structures belonging to the scene. We propose a robust and automatic algorithm for frame-by-frame line scratch detection in old films, as well as a temporal algorithm for the filtering of false detections. In the frame-by-frame algorithm, we relax some of the hypotheses used in previous algorithms in order to detect a wider variety of scratches. This step's robustness and lack of external parameters is ensured by the combined use of an a contrario methodology and local statistical estimation. In this manner, over-detection in textured or cluttered areas is greatly reduced. The temporal filtering algorithm eliminates false detections due to thin vertical structures by exploiting the coherence of their motion with that of the underlying scene. Experiments demonstrate the ability of the resulting detection procedure to deal with difficult situations, in particular in the presence of noise, texture, and slanted or partial scratches. Comparisons show significant advantages over previous work.

Acquiring scenery depth is a fundamental task in computer vision, with many applications in manufacturing, surveillance, or robotics relying on accurate scenery information. Time-of-flight cameras can provide depth information in real-time and overcome short-comings of traditional stereo analysis. However, they provide limited spatial resolution and sophisticated upscaling algorithms are sought after. In this paper, we present a sensor fusion approach to time-of-flight super resolution, based on the combination of depth and texture sources. Unlike other texture guided approaches, we interpret the depth upscaling process as a weighted energy optimization problem. Three different weights are introduced, employing different available sensor data. The individual weights address object boundaries in depth, depth sensor noise, and temporal consistency. Applied in consecutive order, they form three weighting strategies for time-of-flight super resolution. Objective evaluations show advantages in depth accuracy and for depth image based rendering compared with state-of-the-art depth upscaling. Subjective view synthesis evaluation shows a significant increase in viewer preference by a factor of four in stereoscopic viewing conditions. To the best of our knowledge, this is the first extensive subjective test performed on time-of-flight depth upscaling. Objective and subjective results proof the suitability of our approach to time-of-flight super resolution approach for depth scenery capture. This work was supported in part by the KKFoundation of Sweden under Grant 2009/0264, in part by the EU Euro-pean Regional Development Fund, Mellersta Norrland, Sweden, under Grant 00156702, and in part by Länsstyrelsen Västernorrland, Sweden, under Grant 00155148. Realistic3D