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.
Dry and wet fingers lead to poor fingerprint quality, which means that it has impact for fingerprint recognition and matching. Recognition methods that are based on the feature of ridge, valley, minutiae or pore are affected by skin conditions. In this paper, we propose a novel dry fingerprint detection method for images with different resolutions using ridge features. The dry fingerprints have vague...
In this paper we study and analyze the problem of self-interference in transceivers performing inter-band carrier aggregation, where separate power amplifiers (PAs) are used for each component carrier (CC). The self-interference stems from the nonlinear behaviour of the passive RF components at the transmitter, which results in passive intermodulation terms that in some cases fall onto the RX band...
Multi-channel imaging like RGB is common today, however, a custom configuration of other modalities, such as wavelengths or polarization, is expensive and often unavailable. We propose a novel configurable multi-modal imaging system that solves this problem by using off-the-shelf components and proper fusion algorithms. The paper shows the application of polarization imaging for machine vision inspection...
To realize Electrocardiography (ECG) signals monitoring systems, compressive sensing (CS) is a new technique to reduce power of biosensors and data transmission. Instead of spending high complexity on reconstructing back to data domain to do signal analysis, compressed analysis (CA) exploits the data structure preserved by CS to directly analyze in the compressed domain. However, compressively-sensed...
This article presents a method to obtain personalized Head-Related Transfer Functions (HRTFs) for creating virtual soundscapes based on small amount of measurements. The best matching set of HRTFs are selected among the entries from publicly available databases. The proposed method is evaluated using a listening test where subjects assess the audio samples created using the best matching set of HRTFs...
Massive multiuser multi-input multi-output (MU-MIMO) system adopting large amount of antennas is a promising technique to improve spectral efficiency and energy efficiency for next generation wireless communication systems. In practice, the channels composed of pairs of transmit and receive antennas are often correlated and computational complexity is one of the critical concern in implementation...
In this paper, we consider the direction-of-arrivals (DOAs) estimation of coherent narrowband signals impinging on an arbitrary linear array in a computational efficient way. A new interpolation transform based modified Capon beam-forming method is proposed without eigendecomposition, where the arbitrary linear array is transformed to a virtual uniform linear array (ULA) by utilizing the interpolation...
Internet-of-Things (IoT) applications grew rapidly in recent years. Deployment of massive machine-type communication (mMTC) with scalability and reliability becomes a challenging issue. The feature of activity sparsity in mMTC devices makes room for us to efficiently handle detection by compressive sensing (CS)-based multi-user detection (CS-MUD). However, the limited resource, such as the design...
This paper describes FPGA implementation of object recognition processor for HDTV resolution 30 fps video using the Sparse FIND feature. Two-stage feature extraction processing by HOG and Sparse FIND, a highly parallel classification in the support vector machine (SVM), and a block-parallel processing for RAM access cycle reduction are proposed to perform a real time object recognition with enormous...
Different neural network models have been proposed to design efficient associative memories like Hopfield networks, Boltzmann machines or Cogent confabulation. Compared to the classical models, Encoded Neural Network (ENN) is a recently introduced formalism with a proven higher efficiency. This model has been improved through different contributions like Clone-based ENN (CbNNs) or Sparse ENNs (S-ENNs)...
In this paper, we propose an energy-efficient approximate multiplier design approach. Fundamental to this approach is configurable lossy logic compression, coupled with low-cost error mitigation. The logic compression is aimed at reducing the number of product rows using progressive bit significance, and thereby decreasing the number of reduction stages in Wallace-tree accumulation. This accounts...
The paper presents the results of design space explorations for the implementation of the Smith-Waterman (S-W) algorithm performing DNA and protein sequences alignment. Both design explorations studies and FPGA implementations are obtained by developing a dynamic dataflow program implementing the algorithm and by direct high-level synthesis (HLS) to FPGA HDL. The main feature of the obtained implementation...
Thanks to their ability to absorb large amounts of data, Convolutional Neural Networks (CNNs) have become state-of-the-art in numerous vision challenges, sometimes even on par with biological vision. They rely on optimisation routines that typically require intensive computational power, thus the question of embedded architectures is a very active field of research. Of particular interest is the problem...
This paper presents a comparison between custom fixed-point (FxP) and floating-point (FlP) arithmetic, applied to bidimensional K-means clustering algorithm. After a discussion on the K-means clustering algorithm and arithmetic characteristics, hardware implementations of FxP and FlP arithmetic operators are compared in terms of area, delay and energy, for different bitwidth, using the ApxPerf2.0...
A number of algorithms capable of iteratively calculating a polynomial matrix eigenvalue decomposition (PEVD) have been introduced. The PEVD is an extension of the ordinary EVD to polynomial matrices and will diagonalise a parahermitian matrix using paraunitary operations. Inspired by recent work towards a low complexity divide-and-conquer PEVD algorithm, this paper analyses the performance of this...
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.