The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents an analysis of the parameters used to construct 2D log-Gabor filters to encode iris patterns. This filter is a band-pass complex filter composed by four parameters that are used to extract information direct in the 2D domain. An iris recognition system, composed by segmentation, normalization, encoding and matching is also described. The segmentation module combines the Pulling...
An information hiding method on escape sequences of Huffman coding which can embed a great deal of secret information into AAC files is proposed based on the research of AAC coding standard. The proposed algorithm first unpacks the cover AAC file to search for the escape sequences, and then modifies least significant bit (LSB) of the escape sequences with the approach of matrix encoding, to improve...
In this paper, we present a fast biological data mining algorithm named IRTM based on embedded frequent subtree. We also advance a string encoding method for representing the trees, a scope-list for extending all substrings and some pruning rules which can further reduce the computational time and space cost. Experimental results show that IRTM algorithm can achieve significantly performance improvement...
The mobile robot which accomplishes a work in explored region does not know location information of surroundings. Traditionally, simultaneous localization and mapping(SLAM) algorithms solve the localization and mapping problem in explored regions. Among the several SLAM algorithms, the EKF (Extended Kalman Filter) based SLAM is the scheme most widely used. The EKF is the optimal sensor fusion method...
Note that network coding allows immediate nodes to mix information from different data flows. On the basis of this observation, we prove that under suitable conditions, communicators can communicate with perfect secrecy over wiretap networks. Our method of secure communication over wiretap networks without keys is fundamentally distinct from cryptographic means. Furthermore, a linear network code...
The need for watermarking database relations to deter their piracy, identify the unique characteristics of relational data which pose new challenges for watermarking, and provide desirable properties of a watermarking system for relational data. Proving ownership rights on outsourced relational databases is a crucial issue in today's Internet-based application environments and in many content distribution...
In this paper design of multiplier-less nonuniform filterbank transmultiplexer (ML NUFB TMUX) is presented. Nonuniform filter bank transmultiplexer (NUFB TMUX) is preferred when applications with different data rates are to be multiplexed. If filter coefficients can be represented in canonic signed digit (CSD) format with minimum number of signed power of two (SPT) terms, hardware complexity can be...
OGC (open geospatial consortium) has developed the implementation specifications especially WMS (Web map service) and WFS (Web feature service) which facilitate GIS data dissemination including the map image distribution for visualization and online GIS data exchange. WPS (Web processing service) is also one of the OGC specifications for processing service which allow GIS functions available on the...
This paper presents an imitation mechanism and a study of its behavior in spatial grid-based configurations. The imitation mechanism replicates external signals without associating with objects, as in higher-level imitation; it is therefore a model of proto-imitation where agents imitate unconditionally the agents they happen to interact with. We study the mechanism in 2D space to understand how it...
Association rule mining based on support and confidence generates a large number of rules. However, post analysis is required to obtain interesting rules as many of the generated rules are useless. We pose mining association rules as multi-objective optimization problem where objective functions are rule interestingness measures and use NSGA-II, a well known multi-objective evolutionary algorithm...
Differential evolution (DE) algorithm is a heuristic approach that gains more interest in today's research. It finds the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithm using similar operators; crossover, mutation and selection. This paper addresses the restrictive...
Underwater wireless sensor networks (UWSNs) are prone to message loss due to their poor link condition with high bit error rate (BER). Retransmission-based mechanisms such as ARQ can be used for the reliability, however, they are not suitable for UWSNs due to the inherent long propagation delay of UWSNs. Therefore, a forward error correction (FEC) mechanism might be an alternative in order to guarantee...
In today's world of globalization, local language storage and retrieval is essential for the developing nations like India. As our country is diversified by languages and only 10% of population is aware of English language, this diversity of languages is becoming barrier to understand and acquainted in digital world. It has been found that when services are provided in local languages, it has been...
Peptide computing is a novel way of computing that uses the interaction between peptides and antibodies as a computational model. Since several copies of peptides and antibodies can interact at the same time, this computing model is massively parallel and highly non-deterministic in nature. Due to these advantages this computational model helps us to solve some of the very hard combinatorial problems...
Hyper-heuristics are increasingly used in function and combinatorial optimization. Rather than attempt to solve a problem using a fixed heuristic, a hyper-heuristic approach attempts to find a combination of heuristics that solve a problem (and in turn may be directly suitable for a class of problem instances). Hyper-heuristics have been little explored in data mining. Here we apply a hyper-heuristic...
Single Row Facility Layout Problem (SRFLP) consists of arranging a number of rectangular facilities with varying length on one side of a straight line to minimize the weighted sum of the distance between all facility pairs. In this paper we use a Particle Swarm Optimization (PSO) algorithm to solve the SRFLP. We first employ a new coding and decoding technique to efficiently map discrete feasible...
The following topics are dealt with: neural networks; equalisation; mobile and cellular communications; optical communications; data security; human factors in communications; coding and modulation; optical networks; database and optimisation; time-frequency analysis; computer vision and recognition; audio and speech processing; wireless networks; watermarking; digital filters; network coding and...
A configurable fixed-point multiplier for digital signal processing (DSP) applications is proposed in this paper. It is implemented in four pipeline stages. The proposed multiplier supports multiple-precision operations, including one 32??32, two 16??32, two 16??16 or four 8??8 signed/unsigned multiplication operations and 16-bit or 8-bit dot product/double dot product operations. It is modeled in...
It is known that given the real sum of two independent uniformly distributed lattice points from the same nested lattice codebook, the eavesdropper can obtain at most 1 bit of information per channel regarding the value of one of the lattice points. In this work, we study the effect of this 1 bit information on the equivocation expressed in three commonly used information theoretic measures, i.e.,...
We describe a scheme for rate-distortion with distributed encoding in which the sources to be compressed contain a common component. We show that this scheme is optimal in some situations and that it strictly improves upon existing schemes, which do not make full use of common components. This resolves in the negative an open question regarding whether independent quantization followed by independent...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.