Fusion of Text and Image in Multimedia Information Retrieval System

Multimedia Information Retrieval is very useful for any application in our daily work. Most of the applications consist of Multimedia data that are images, text, audio and video. Multimedia information retrieval system is used to search an image. There are same meanings for different data which is also known as semantic gap. This problem is solved by fusion of text based image retrieval and content based image retrieval. Weighted Mean, OWA and WOWA are aggregation operators used in this system for the fusion of text and image numeric values. The Scale invariant feature transforms and speeded up robust feature are two algorithms for feature extraction. To increase the speed of system, the speeded up robust feature algorithm is used. Bag of Words and Bag of Visual Word approaches are used in this system for retrieving images. DOI: 10.17762/ijritcc2321-8169.15066

Dynamic Defense Against Byzantine Poisoning Attacks in Federated Learning

Federated learning, as a distributed learning that conducts the training on the local devices without accessing to the training data, is vulnerable to Byzatine poisoning adversarial attacks. We argue that the federated learning model has to avoid those kind of adversarial attacks through filtering out the adversarial clients by means of the federated aggregation operator. We propose a dynamic federated aggregation operator that dynamically discards those adversarial clients and allows to prevent the corruption of the global learning model. We assess it as a defense against adversarial attacks deploying a deep learning classification model in a federated learning setting on the Fed-EMNIST Digits, Fashion MNIST and CIFAR-10 image datasets. The results show that the dynamic selection of the clients to aggregate enhances the performance of the global learning model and discards the adversarial and poor (with low quality models) clients.R&D&I grants - MCIN/AEI, Spain PID-2020-119478GB-I00 PID2020-116118GA-I00 EQC2018-005-084-PERDF A way of making EuropeMCIN/AEI FPU18/04475 IJC2018-036092-

A mathematical morphology approach for a qualitative exploration of drought events in space and time

Drought events occur worldwide and possibly incur severe consequences. Trying to understand and characterize drought events is of considerable importance in order to improve the preparedness for coping with future events. In this paper, we present a methodology that allows for the delineation of drought events by exploiting their spatiotemporal nature. To that end, we apply operators borrowed from mathematical morphology to represent drought events as connected components in space and time. As an illustration, we identify drought events on the basis of a 35-year data set of daily soil moisture values covering mainland Australia. We then extract characteristics reflecting the affected area, duration and intensity from the proposed representation of a drought event in order to illustrate the impact of tuning parameters in the methodology presented. Yet, this paper we refrain from comparing with other drought delineation methods

Exploiting Data Reliability and Fuzzy Clustering for Journal Ranking

This is the author accepted manuscript. The final version is available from IEEE Computational Intelligence Society via http://dx.doi.org/10.1109/TFUZZ.2016.2612265Journal impact indicators are widely accepted as possible measurements of academic journal quality. However, much debate has recently surrounded their use, and alternative journal impact evaluation techniques are desirable. Aggregation of multiple indicators offers a promising method to produce a more robust ranking result, avoiding the possible bias caused by the use of a single impact indicator. In this paper, fuzzy aggregation and fuzzy clustering, especially the Ordered Weighted Averaging (OWA) operators are exploited to aggregate the quality scores of academic journals that are obtained from different impact indicators. Also, a novel method for linguistic term-based fuzzy cluster grouping is proposed to rank academic journals. The work allows for the construction of distinctive fuzzy clusters of academic journals on the basis of their performance with respect to different journal impact indicators, which may be subsequently combined via the use of the OWA operators. Journals are ranked in relation to their memberships in the resulting combined fuzzy clusters. In particular, the nearest-neighbour guided aggregation operators are adopted to characterise the reliability of the indicators, and the fuzzy clustering mechanism is utilised to enhance the interpretability of the underlying ranking procedure. The ranking results of academic journals from six subjects are systematically compared with the outlet ranking used by the Excellence in Research for Australia (ERA), demonstrating the significant potential of the proposed approach.publishersversionPeer reviewe

Spatially-variant noise filtering in magnetic resonance imaging : a consensus-based approach

In order to accelerate the acquisition process in multiple-coil Magnetic Resonance scanners, parallel techniques were developed. These techniques reduce the acquisition time via a sub-sampling of the k-space and a reconstruction process. From a signal and noise perspective, the use of a acceleration techniques modify the structure of the noise within the image. In the most common algorithms, like SENSE, the final magnitude image after the reconstruction is known to follow a Rician distribution for each pixel, just like single coil systems. However, the noise is spatially non-stationary, i.e. the variance of noise becomes x-dependent. This effect can also be found in magnitude images due to other processing inside the scanner. In this work we propose a method to adapt well-known noise filtering techniques initially designed to deal with stationary noise to the case of spatially variant Rician noise. The method copes with inaccurate estimates of variant noise patterns in the image, showing its robustness in realistic cases. The method employs a consensus strategy in conjunction with a set of aggregation functions and a penalty function. Multiple possible outputs are generated for each pixel assuming different unknown input parameters. The consensus approach merges them into a unique filtered image. As a filtering technique, we have selected the Linear Minimum Mean Square Error (LMMSE) estimator for Rician data, which has been used to test our methodology due to its simplicity and robustness. Results with synthetic and in vivo data confirm the good behavior of our approach

Linguistic OWA and time windows based Fault Identification in wide plants

Producción CientíficaFault detection and diagnosis in industrial processes are challenging tasks that demand effective and timely decision making procedures. The multivariate statistical approaches for fault detection based on data have been very useful. However, they are known to be less powerful for fault diagnosis because they normally require prior knowledge of the problem involved. In this context, this proposal is based on an on-line, distributed fault isolation approach to provide a scored rank of variables considered as respon- sible for the faults in a more robust and earlier way than usual approaches. The fault isolation is carried out considering some top Fault Isolation (FI) methods, without prior knowledge regarding faults, in a distributed and collaborative way by a linguistic based decision making. The isolation of faulty variables provided by each FI approach is aggregated to provide a fault identification based on a scored ranking at two time points: after the fault detection and when the plant has recovered. In both cases, the final fault isolation is provided as a scored ranking obtained by Ordered Weighted Average operators (OWA) and Regular Increasing Monotone (RIM) aggregation functions, which permit the implementation of linguistic aggregation functions. The risk aversion during this multicriteria isolation is tuned by the user and can provide several strategies or policies. The fault isolation at two key times searches for the origin of faults and evaluates the evolution of the system after the fault’s occurrence in the new working position of the plant. This is because faults in an industrial plant are propagated to different variables due to the actions of the process controllers. This method has been applied to two complex benchmark plants obtaining an earlier and more robust isolation.Este trabajo forma parte del proyecto de investogación: MINECO/FEDER. ref: DPI2015- 67341- C2-2-

Trust networks for recommender systems

Recommender systems use information about their user’s profiles and relationships to suggest items that might be of interest to them. Recommenders that incorporate a social trust network among their users have the potential to make more personalized recommendations compared to traditional systems, provided they succeed in utilizing the additional (dis)trust information to their advantage. Such trust-enhanced recommenders consist of two main components: recommendation technologies and trust metrics (techniques which aim to estimate the trust between two unknown users.) We introduce a new bilattice-based model that considers trust and distrust as two different but dependent components, and study the accompanying trust metrics. Two of their key building blocks are trust propagation and aggregation. If user a wants to form an opinion about an unknown user x, a can contact one of his acquaintances, who can contact another one, etc., until a user is reached who is connected with x (propagation). Since a will often contact several persons, one also needs a mechanism to combine the trust scores that result from several propagation paths (aggregation). We introduce new fuzzy logic propagation operators and focus on the potential of OWA strategies and the effect of knowledge defects. Our experiments demonstrate that propagators that actively incorporate distrust are more accurate than standard approaches, and that new aggregators result in better predictions than purely bilattice-based operators. In the second part of the dissertation, we focus on the application of trust networks in recommender systems. After the introduction of a new detection measure for controversial items, we show that trust-based approaches are more effective than baselines. We also propose a new algorithm that achieves an immediate high coverage while the accuracy remains adequate. Furthermore, we also provide the first experimental study on the potential of distrust in a memory-based collaborative filtering recommendation process. Finally, we also study the user cold start problem; we propose to identify key figures in the network, and to suggest them as possible connection points for newcomers. Our experiments show that it is much more beneficial for a new user to connect to an identified key figure instead of making random connections