Fuzzy geometry, entropy, and image information

Presented here are various uncertainty measures arising from grayness ambiguity and spatial ambiguity in an image, and their possible applications as image information measures. Definitions are given of an image in the light of fuzzy set theory, and of information measures and tools relevant for processing/analysis e.g., fuzzy geometrical properties, correlation, bound functions and entropy measures. Also given is a formulation of algorithms along with management of uncertainties for segmentation and object extraction, and edge detection. The output obtained here is both fuzzy and nonfuzzy. Ambiguity in evaluation and assessment of membership function are also described

A fuzzy measure approach to motion frame analysis for scene detection

This paper addresses a solution to the problem of scene estimation of motion video data in the fuzzy set theoretic framework. Using fuzzy image feature extractors, a new algorithm is developed to compute the change of information in each of two successive frames to classify scenes. This classification process of raw input visual data can be used to establish structure for correlation. The algorithm attempts to fulfill the need for nonlinear, frame-accurate access to video data for applications such as video editing and visual document archival/retrieval systems in multimedia environments

Getting the best out of T2K and NOvA

We explore the combined physics potential of T2K and NOvA in light of the moderately large measured value of theta13. For sin^2 2*theta13 = 0.1, which is close to the best fit value, a 90% C.L. evidence for the hierarchy can be obtained only for the combinations (Normal hierarchy, -170 <= deltaCP <= 0) and (Inverted hierarchy, 0 <= deltaCP <= 170), with the currently planned runs of NOvA and T2K. However, the hierarchy can essentially be determined for any value of deltaCP, if the statistics of NOvA are increased by 50% and those of T2K are doubled. Such an increase will also give an allowed region of deltaCP around its true value, except for the CP conserving cases deltaCP = 0 or 180. We demonstrate that any measurement of deltaCP is not possible without first determining hierarchy. We find that comparable data from a shorter baseline (L ~ 130 km) experiment will not lead to any significant improvement.Comment: Version published in Phys. Rev.

Gene ordering in partitive clustering using microarray expressions

A central step in the analysis of gene expression data is the identification of groups of genes that exhibit similar expression patterns. Clustering and ordering the genes using gene expression data into homogeneous groups was shown to be useful in functional annotation, tissue classification, regulatory motif identification, and other applications. Although there is a rich literature on gene ordering in hierarchical clustering framework for gene expression analysis, there is no work addressing and evaluating the importance of gene ordering in partitive clustering framework, to the best knowledge of the authors. Outside the framework of hierarchical clustering, different gene ordering algorithms are applied on the whole data set, and the domain of partitive clustering is still unexplored with gene ordering approaches. A new hybrid method is proposed for ordering genes in each of the clusters obtained from partitive clustering solution, using microarry gene expressions. Two existing algorithms for optimally ordering cities in travelling salesman problem (TSP), namely, FRAG_GALK and Concorde, are hybridized individually with self organizing MAP to show the importance of gene ordering in partitive clustering framework. We validated our hybrid approach using yeast and fibroblast data and showed that our approach improves the result quality of partitive clustering solution, by identifying subclusters within big clusters, grouping functionally correlated genes within clusters, minimization of summation of gene expression distances, and the maximization of biological gene ordering using MIPS categorization. Moreover, the new hybrid approach, finds comparable or sometimes superior biological gene order in less computation time than those obtained by optimal leaf ordering in hierarchical clustering solution