271,011 research outputs found
High-quality Image Restoration from Partial Mixed Adaptive-Random Measurements
A novel framework to construct an efficient sensing (measurement) matrix,
called mixed adaptive-random (MAR) matrix, is introduced for directly acquiring
a compressed image representation. The mixed sampling (sensing) procedure
hybridizes adaptive edge measurements extracted from a low-resolution image
with uniform random measurements predefined for the high-resolution image to be
recovered. The mixed sensing matrix seamlessly captures important information
of an image, and meanwhile approximately satisfies the restricted isometry
property. To recover the high-resolution image from MAR measurements, the total
variation algorithm based on the compressive sensing theory is employed for
solving the Lagrangian regularization problem. Both peak signal-to-noise ratio
and structural similarity results demonstrate the MAR sensing framework shows
much better recovery performance than the completely random sensing one. The
work is particularly helpful for high-performance and lost-cost data
acquisition.Comment: 16 pages, 8 figure
Fast human activity recognition based on structure and motion
This is the post-print version of the final paper published in Pattern Recognition Letters. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. Copyright @ 2011 Elsevier B.V.We present a method for the recognition of human activities. The proposed approach is based on the construction of a set of templates for each activity as well as on the measurement of the motion in each activity. Templates are designed so that they capture the structural and motion information that is most discriminative among activities. The direct motion measurements capture the amount of translational motion in each activity. The two features are fused at the recognition stage. Recognition is achieved in two steps by calculating the similarity between the templates and motion features of the test and reference activities. The proposed methodology is experimentally assessed and is shown to yield excellent performance.European Commissio
Multicontrast MRI reconstruction with structure-guided total variation
Magnetic resonance imaging (MRI) is a versatile imaging technique that allows
different contrasts depending on the acquisition parameters. Many clinical
imaging studies acquire MRI data for more than one of these contrasts---such as
for instance T1 and T2 weighted images---which makes the overall scanning
procedure very time consuming. As all of these images show the same underlying
anatomy one can try to omit unnecessary measurements by taking the similarity
into account during reconstruction. We will discuss two modifications of total
variation---based on i) location and ii) direction---that take structural a
priori knowledge into account and reduce to total variation in the degenerate
case when no structural knowledge is available. We solve the resulting convex
minimization problem with the alternating direction method of multipliers that
separates the forward operator from the prior. For both priors the
corresponding proximal operator can be implemented as an extension of the fast
gradient projection method on the dual problem for total variation. We tested
the priors on six data sets that are based on phantoms and real MRI images. In
all test cases exploiting the structural information from the other contrast
yields better results than separate reconstruction with total variation in
terms of standard metrics like peak signal-to-noise ratio and structural
similarity index. Furthermore, we found that exploiting the two dimensional
directional information results in images with well defined edges, superior to
those reconstructed solely using a priori information about the edge location.Engineering and Physical Sciences Research Council (Grant ID: EP/H046410/1)This is the final version of the article. It first appeared from Society for Industrial and Applied Mathematics via http://dx.doi.org/10.1137/15M1047325
Experimental study of noise reduction for an unstiffened cylindrical model of an airplane fuselage
Noise reduction measurements were made for a simplified model of an airplane fuselage consisting of an unstiffened aluminum cylinder 0.5 m in diameter by 1.2 m long with a 1.6-mm-thick wall. Noise reduction was first measured with a reverberant field pink-noise load on the cylinder exterior. Next, noise reduction was measured by using a propeller to provide a more realistic noise load on the cylinder. Structural resonance frequencies and acoustic reverberation times for the cylinder interior volume were also measured. Comparison of data from the relatively simple test using reverberant-field noise with data from the more complex propeller-noise tests indicates some similarity in both the overall noise reduction and the spectral distribution. However, all of the test parameters investigated (propeller speed, blade pitch, and tip clearance) had some effect on the noise-reduction spectra. Thus, the amount of noise reduction achieved appears to be somewhat dependent upon the spectral and spatial characteristics of the flight conditions. Information is also presented on cyclinder resonance frequencies, damping, and characteristics of propeller-noise loads
Skin Capacitive Image Stitching and Occlusion Measurements
The aim of this study is to develop new analysis techniques for skin capacitive image stitching and occlusion measurements. Through image stitching, small skin capacitive images can be stitched into large skin capacitive images and, therefore, provide more skin image information. Through occlusion, e.g., keeping the measurement device on skin for a period of time, the skin health status can be studied through time-dependent response curves. Results show that time-dependent skin capacitive imaging curves can tell us the information about transdermal water loss (TEWL) as well as skin surface profiles. By using the structural similarity index measure (SSIM), the TEWL map can be constructed, which shows the water loss map on the skin surface. We first present the theoretical background and then the experimental results
Structure-semantics interplay in complex networks and its effects on the predictability of similarity in texts
There are different ways to define similarity for grouping similar texts into
clusters, as the concept of similarity may depend on the purpose of the task.
For instance, in topic extraction similar texts mean those within the same
semantic field, whereas in author recognition stylistic features should be
considered. In this study, we introduce ways to classify texts employing
concepts of complex networks, which may be able to capture syntactic, semantic
and even pragmatic features. The interplay between the various metrics of the
complex networks is analyzed with three applications, namely identification of
machine translation (MT) systems, evaluation of quality of machine translated
texts and authorship recognition. We shall show that topological features of
the networks representing texts can enhance the ability to identify MT systems
in particular cases. For evaluating the quality of MT texts, on the other hand,
high correlation was obtained with methods capable of capturing the semantics.
This was expected because the golden standards used are themselves based on
word co-occurrence. Notwithstanding, the Katz similarity, which involves
semantic and structure in the comparison of texts, achieved the highest
correlation with the NIST measurement, indicating that in some cases the
combination of both approaches can improve the ability to quantify quality in
MT. In authorship recognition, again the topological features were relevant in
some contexts, though for the books and authors analyzed good results were
obtained with semantic features as well. Because hybrid approaches encompassing
semantic and topological features have not been extensively used, we believe
that the methodology proposed here may be useful to enhance text classification
considerably, as it combines well-established strategies
Learning with Graphs using Kernels from Propagated Information
Traditional machine learning approaches are designed to learn from independent vector-valued data points. The assumption that instances are independent, however, is not always true. On the contrary, there are numerous domains where data points are cross-linked, for example social networks, where persons are linked by friendship relations. These relations among data points make traditional machine learning diffcult and often insuffcient. Furthermore, data points themselves can have complex structure, for example molecules or proteins constructed from various bindings of different atoms. Networked and structured data are naturally represented by graphs, and for learning we aimto exploit their structure to improve upon non-graph-based methods. However, graphs encountered in real-world applications often come with rich additional information. This naturally implies many challenges for representation and learning: node information is likely to be incomplete leading to partially labeled graphs, information can be aggregated from multiple sources and can therefore be uncertain, or additional information on nodes and edges can be derived from complex sensor measurements, thus being naturally continuous. Although learning with graphs is an active research area, learning with structured data, substantially modeling structural similarities of graphs, mostly assumes fully labeled graphs of reasonable sizes with discrete and certain node and edge information, and learning with networked data, naturally dealing with missing information and huge graphs, mostly assumes homophily and forgets about structural similarity. To close these gaps, we present a novel paradigm for learning with graphs, that exploits the intermediate results of iterative information propagation schemes on graphs. Originally developed for within-network relational and semi-supervised learning, these propagation schemes have two desirable properties: they capture structural information and they can naturally adapt to the aforementioned issues of real-world graph data. Additionally, information propagation can be efficiently realized by random walks leading to fast, flexible, and scalable feature and kernel computations. Further, by considering intermediate random walk distributions, we can model structural similarity for learning with structured and networked data. We develop several approaches based on this paradigm. In particular, we introduce propagation kernels for learning on the graph level and coinciding walk kernels and Markov logic sets for learning on the node level. Finally, we present two application domains where kernels from propagated information successfully tackle real-world problems
- …