7980241
Segmenting magnetic resonance images via hierarchical mixture modelling
We present a statistically innovative as well as scientifically and practically relevant method for automatically segmenting magnetic resonance images using hierarchical mixture models. Our method is a general tool for automated cortical analysis which promises to contribute substantially to the science of neuropsychiatry. We demonstrate that our method has advantages over competing approaches on a magnetic resonance brain imagery segmentation task.
7684635
Information-Theoretic Bounds on Target Recognition Performance Based on Degraded Image Data
This paper derives bounds on the performance of statistical object recognition systems, wherein an image of a target is observed by a remote sensor. Detection and recognition problems are modeled as composite hypothesis testing problems involving nuisance parameters. We develop information-theoretic performance bounds on target recognition based on statistical models for sensors and data, and examine conditions under which these bounds are tight. In particular, we examine the validity of asymptotic approximations to probability of error in such imaging problems. Problems involving Gaussian, Poisson, and multiplicative noise, and random pixel deletions are considered, as well as least-favorable Gaussian clutter. A sixth application involving compressed sensor image data is considered in some detail. This study provides a systematic and computationally attractive framework for analytically characterizing target recognition performance under complicated, non-Gaussian models and optimizing system parameters.
12136431
Training Teams with Collaborative Agents
Training teams is an activity that is expensive, time-consuming, hazardous in some cases, and can be limited by availability of equipment and personnel. In team training, the focus is on optimizing interactions, such as efficiency of communication, conflict resolution and prioritization, group situation awareness, resource distribution and load balancing, etc. This paper presents an agent-based approach to designing intelligent team training systems. We envision a computer-based training system in which teams are trained by putting them through scenarios, which allow them to practice their team skills. There are two important roles that intelligent agents can play; these are as virtual team members and as coach. To carry out these functions, these agents must be equipped with an understanding of the task domain, the team structure, the selected decision-making process and their belief about other team members' mental states.
7955941
Leveraging Channel Diversity for Key Establishment in Wireless Sensor Networks
As the use of sensor networks increases, security in this domain becomes a very real concern. One fundamental aspect of providing confidentiality and authentication is key distribution. While public-key encryption has provided these properties historically, sensors are resource constrained and benefit from symmetric key approaches. In this work, we propose a novel protocol for symmetric key distribution that uses the multiple channels available on sensor hardware. This channel diversity, along with spatial diversity of device locations, allows neighboring sensors to establish secure link keys from plaintext keys that are broadcast by sensors in their neighborhood. In particular, we show that using even one extra channel during the initialization procedure significantly improves the security of key establishment. Via analysis and simulation, we show that our protocol performs well in terms of network connectivity and resilience to colluding malicious devices, when compared to previous work. We show that our protocol can achieve over 90% connectivity among neighboring sensors with link keys that are uncompromised even when 80% of the devices in the network are malicious and collude. Finally, we present a thorough discussion of the comparative advantages and disadvantages of our approach compared to previous techniques.
35322596
On the degrees of a strongly vertex-magic graph
Let G=(V,E) be a finite graph, where |V|=n>=2 and |E|=e>=1. A vertex-magic total labeling is a bijection @l from V@?E to the set of consecutive integers {1,2,...,n+e} with the property that for every v@?V, @l(v)+@?"w"@?"N"("v")@l(vw)=h for some constant h. Such a labeling is strong if @l(V)={1,2,...,n}. In this paper, we prove first that the minimum degree of a strongly vertex-magic graph is at least two. Next, we show that if 2e>=10n^2-6n+1, then the minimum degree of a strongly vertex-magic graph is at least three. Further, we obtain upper and lower bounds of any vertex degree in terms of n and e. As a consequence we show that a strongly vertex-magic graph is maximally edge-connected and hamiltonian if the number of edges is large enough. Finally, we prove that semi-regular bipartite graphs are not strongly vertex-magic graphs, and we provide strongly vertex-magic total labeling of certain families of circulant graphs.
10536355
Further results on almost Moore digraphs
The nonexistence of digraphs with order equal to the Moore bound Md k d d k for d k has lead to the study of the problem of the existence of almost Moore digraphs namely digraphs with order close to the Moore bound In it was shown that almost Moore digraphs of order Md k degree d diameter k d k contain either no cycle of length k or exactly one such cycle In this paper we shall derive some further necessary conditions for the existence of almost Moore digraphs for degree and diameter greater than As a consequence for diameter and degree d d we show that there are no almost Moore digraphs of order Md with one vertex in a C except the digraphs with every vertex in C
15423783
Group Actions, Homeomorphisms, and Matching: A General Framework
This paper constructs metrics on the space of images I defined as orbits under group actions G. The groups studied include the finite dimensional matrix groups and their products, as well as the infinite dimensional diffeomorphisms examined in Trouvé (1999, Quaterly of Applied Math.) and Dupuis et al. (1998). Quaterly of Applied Math. Left-invariant metrics are defined on the product G × I thus allowing the generation of transformations of the background geometry as well as the image values. Examples of the application of such metrics are presented for rigid object matching with and without signature variation, curves and volume matching, and structural generation in which image values are changed supporting notions such as tissue creation in carrying one image to another.