Improved Parallel Algorithms for Spanners and Hopsets

We use exponential start time clustering to design faster and more work-efficient parallel graph algorithms involving distances. Previous algorithms usually rely on graph decomposition routines with strict restrictions on the diameters of the decomposed pieces. We weaken these bounds in favor of stronger local probabilistic guarantees. This allows more direct analyses of the overall process, giving: * Linear work parallel algorithms that construct spanners with $O(k)$ stretch and size $O(n^{1+1/k})$ in unweighted graphs, and size $O(n^{1+1/k} \log k)$ in weighted graphs. * Hopsets that lead to the first parallel algorithm for approximating shortest paths in undirected graphs with $O(m\;\mathrm{polylog}\;n)$ work

Fuzzy Clustering Image Segmentation Based on Particle Swarm Optimization

Image segmentation refers to the technology to segment the image into different regions with different characteristics and to extract useful objectives, and it is a key step from image processing to image analysis. Based on the comprehensive study of image segmentation technology, this paper analyzes the advantages and disadvantages of the existing fuzzy clustering algorithms; integrates the particle swarm optimization (PSO) with the characteristics of global optimization and rapid convergence and fuzzy clustering (FC) algorithm with fuzzy clustering effects starting from the perspective of particle swarm and fuzzy membership restrictions and gets a PSO-FC image segmentation algorithm so as to effectively avoid being trapped into the local optimum and improve the stability and reliability of clustering algorithm. The experimental results show that this new PSO-FC algorithm has excellent image segmentation effects

A niching memetic algorithm for simultaneous clustering and feature selection

Clustering is inherently a difficult task, and is made even more difficult when the selection of relevant features is also an issue. In this paper we propose an approach for simultaneous clustering and feature selection using a niching memetic algorithm. Our approach (which we call NMA_CFS) makes feature selection an integral part of the global clustering search procedure and attempts to overcome the problem of identifying less promising locally optimal solutions in both clustering and feature selection, without making any a priori assumption about the number of clusters. Within the NMA_CFS procedure, a variable composite representation is devised to encode both feature selection and cluster centers with different numbers of clusters. Further, local search operations are introduced to refine feature selection and cluster centers encoded in the chromosomes. Finally, a niching method is integrated to preserve the population diversity and prevent premature convergence. In an experimental evaluation we demonstrate the effectiveness of the proposed approach and compare it with other related approaches, using both synthetic and real data

Spike Clustering and Neuron Tracking over Successive Time Windows

This paper introduces a new methodology for tracking signals from individual neurons over time in multiunit extracellular recordings. The core of our strategy relies upon an extension of a traditional mixture model approach, with parameter optimization via expectation-maximimization (EM), to incorporate clustering results from the preceding time period in a Bayesian manner. EM initialization is also achieved by utilizing these prior clustering results. After clustering, we match the current and prior clusters to track persisting neurons. Applications of this spike sorting method to recordings from macaque parietal cortex show that it provides significantly more consistent clustering and tracking results

Non-Parametric Probabilistic Image Segmentation

We propose a simple probabilistic generative model for image segmentation. Like other probabilistic algorithms (such as EM on a Mixture of Gaussians) the proposed model is principled, provides both hard and probabilistic cluster assignments, as well as the ability to naturally incorporate prior knowledge. While previous probabilistic approaches are restricted to parametric models of clusters (e.g., Gaussians) we eliminate this limitation. The suggested approach does not make heavy assumptions on the shape of the clusters and can thus handle complex structures. Our experiments show that the suggested approach outperforms previous work on a variety of image segmentation tasks

Automated Global Feature Analyzer - A Driver for Tier-Scalable Reconnaissance

For the purposes of space flight, reconnaissance field geologists have trained to become astronauts. However, the initial forays to Mars and other planetary bodies have been done by purely robotic craft. Therefore, training and equipping a robotic craft with the sensory and cognitive capabilities of a field geologist to form a science craft is a necessary prerequisite. Numerous steps are necessary in order for a science craft to be able to map, analyze, and characterize a geologic field site, as well as effectively formulate working hypotheses. We report on the continued development of the integrated software system AGFA: automated global feature analyzerreg, originated by Fink at Caltech and his collaborators in 2001. AGFA is an automatic and feature-driven target characterization system that operates in an imaged operational area, such as a geologic field site on a remote planetary surface. AGFA performs automated target identification and detection through segmentation, providing for feature extraction, classification, and prioritization within mapped or imaged operational areas at different length scales and resolutions, depending on the vantage point (e.g., spaceborne, airborne, or ground). AGFA extracts features such as target size, color, albedo, vesicularity, and angularity. Based on the extracted features, AGFA summarizes the mapped operational area numerically and flags targets of "interest", i.e., targets that exhibit sufficient anomaly within the feature space. AGFA enables automated science analysis aboard robotic spacecraft, and, embedded in tier-scalable reconnaissance mission architectures, is a driver of future intelligent and autonomous robotic planetary exploration