scholarly journals A Comparison of Compression Codecs for Maritime and Sonar Images in Bandwidth Constrained Applications

Computers ◽  
2019 ◽  
Vol 8 (2) ◽  
pp. 32 ◽  
Author(s):  
Chiman Kwan ◽  
Jude Larkin ◽  
Bence Budavari ◽  
Bryan Chou ◽  
Eric Shang ◽  
...  
Keyword(s):  
Compression Ratio ◽  
Error Concealment ◽  
Performance Metrics ◽  
State Of The Art ◽  
Communication Channels ◽  
Lossless Compression ◽  
System Model ◽  
Transmission Errors ◽  
Performance Metric ◽  
Sonar Images

Since lossless compression can only achieve two to four times data compression, it may not be efficient to deploy lossless compression in bandwidth constrained applications. Instead, it would be more economical to adopt perceptually lossless compression, which can attain ten times or more compression without loss of important information. Consequently, one can transmit more images over bandwidth limited channels. In this research, we first aimed to compare and select the best compression algorithm in the literature to achieve a compression ratio of 0.1 and 40 dBs or more in terms of a performance metric known as human visual system model (HVSm) for maritime and sonar images. Our second objective was to demonstrate error concealment algorithms that can handle corrupted pixels due to transmission errors in interference-prone communication channels. Using four state-of-the-art codecs, we demonstrated that perceptually lossless compression can be achieved for realistic maritime and sonar images. At the same time, we also selected the best codec for this purpose using four performance metrics. Finally, error concealment was demonstrated to be useful in recovering lost pixels due to transmission errors.

scholarly journals Automatically Designing State-of-the-Art Multi- and Many-Objective Evolutionary Algorithms

2020 ◽  
Vol 28 (2) ◽  
pp. 195-226 ◽  
Author(s):  
Leonardo C. T. Bezerra ◽  
Manuel López-Ibáñez ◽  
Thomas Stützle
Keyword(s):  
Evolutionary Algorithms ◽  
Performance Metrics ◽  
State Of The Art ◽  
Continuous Optimization ◽  
Parameter Tuning ◽  
High Performing ◽  
Performance Metric ◽  
Wide Range ◽  
Algorithmic Framework ◽  
Art Performance

A recent comparison of well-established multiobjective evolutionary algorithms (MOEAs) has helped better identify the current state-of-the-art by considering (i) parameter tuning through automatic configuration, (ii) a wide range of different setups, and (iii) various performance metrics. Here, we automatically devise MOEAs with verified state-of-the-art performance for multi- and many-objective continuous optimization. Our work is based on two main considerations. The first is that high-performing algorithms can be obtained from a configurable algorithmic framework in an automated way. The second is that multiple performance metrics may be required to guide this automatic design process. In the first part of this work, we extend our previously proposed algorithmic framework, increasing the number of MOEAs, underlying evolutionary algorithms, and search paradigms that it comprises. These components can be combined following a general MOEA template, and an automatic configuration method is used to instantiate high-performing MOEA designs that optimize a given performance metric and present state-of-the-art performance. In the second part, we propose a multiobjective formulation for the automatic MOEA design, which proves critical for the context of many-objective optimization due to the disagreement of established performance metrics. Our proposed formulation leads to an automatically designed MOEA that presents state-of-the-art performance according to a set of metrics, rather than a single one.

scholarly journals A Reference-Free Lossless Compression Algorithm for DNA Sequences Using a Competitive Prediction of Two Classes of Weighted Models

Entropy ◽  
2019 ◽  
Vol 21 (11) ◽  
pp. 1074 ◽  
Author(s):  
Diogo Pratas ◽  
Morteza Hosseini ◽  
Jorge M. Silva ◽  
Armando J. Pinho
Keyword(s):  
Prediction Model ◽  
Compression Ratio ◽  
Dna Sequences ◽  
State Of The Art ◽  
Lossless Compression ◽  
Efficient Implementation ◽  
Inverted Repeats ◽  
Efficient Data ◽  
Computational Resources ◽  
Context Models

The development of efficient data compressors for DNA sequences is crucial not only for reducing the storage and the bandwidth for transmission, but also for analysis purposes. In particular, the development of improved compression models directly influences the outcome of anthropological and biomedical compression-based methods. In this paper, we describe a new lossless compressor with improved compression capabilities for DNA sequences representing different domains and kingdoms. The reference-free method uses a competitive prediction model to estimate, for each symbol, the best class of models to be used before applying arithmetic encoding. There are two classes of models: weighted context models (including substitutional tolerant context models) and weighted stochastic repeat models. Both classes of models use specific sub-programs to handle inverted repeats efficiently. The results show that the proposed method attains a higher compression ratio than state-of-the-art approaches, on a balanced and diverse benchmark, using a competitive level of computational resources. An efficient implementation of the method is publicly available, under the GPLv3 license.

scholarly journals Performance Evaluation of Multichannel Audio Compression

2018 ◽  
Vol 10 (1) ◽  
pp. 146
Author(s):  
Teddy Surya Gunawan ◽  
Mira Kartiwi
Keyword(s):  
Performance Evaluation ◽  
Performance Metrics ◽  
Lossless Compression ◽  
Audio Signals ◽  
Audio Quality ◽  
Multichannel Audio ◽  
Performance Metric ◽  
Audio Files ◽  
Channel Configuration ◽  
Integrated Performance

<p>In recent years, multichannel audio systems are widely used in modern sound devices as it can provide more realistic and engaging experience to the listener. This paper focuses on the performance evaluation of three lossy, i.e. AAC, Ogg Vorbis, and Opus, and three lossless compression, i.e. FLAC, TrueAudio, and WavPack, for multichannel audio signals, including stereo, 5.1 and 7.1 channels. Experiments were conducted on the same three audio files but with different channel configurations. The performance of each encoder was evaluated based on its encoding time (averaged over 100 times), data reduction, and audio quality. Usually, there is always a trade-off between the three metrics. To simplify the evaluation, a new integrated performance metric was proposed that combines all the three performance metrics. Using the new measure, FLAC was found to be the best lossless compression, while Ogg Vorbis and Opus were found to be the best for lossy compression depends on the channel configuration. This result could be used in determining the proper audio format for multichannel audio systems.</p>

scholarly journals Heuristic rank selection with progressively searching tensor ring network

2021 ◽  
Author(s):  
Nannan Li ◽  
Yu Pan ◽  
Yaran Chen ◽  
Zixiang Ding ◽  
Dongbin Zhao ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Compression Ratio ◽  
State Of The Art ◽  
Heuristic Method ◽  
Ring Networks ◽  
Ring Network ◽  
Narrow Region ◽  
Network Search ◽  
Deep Networks ◽  
Evolutionary Phase

AbstractRecently, tensor ring networks (TRNs) have been applied in deep networks, achieving remarkable successes in compression ratio and accuracy. Although highly related to the performance of TRNs, rank selection is seldom studied in previous works and usually set to equal in experiments. Meanwhile, there is not any heuristic method to choose the rank, and an enumerating way to find appropriate rank is extremely time-consuming. Interestingly, we discover that part of the rank elements is sensitive and usually aggregate in a narrow region, namely an interest region. Therefore, based on the above phenomenon, we propose a novel progressive genetic algorithm named progressively searching tensor ring network search (PSTRN), which has the ability to find optimal rank precisely and efficiently. Through the evolutionary phase and progressive phase, PSTRN can converge to the interest region quickly and harvest good performance. Experimental results show that PSTRN can significantly reduce the complexity of seeking rank, compared with the enumerating method. Furthermore, our method is validated on public benchmarks like MNIST, CIFAR10/100, UCF11 and HMDB51, achieving the state-of-the-art performance.

scholarly journals Robust Visibility Surface Determination in Object Space via Plücker Coordinates

2021 ◽  
Vol 7 (6) ◽  
pp. 96
Author(s):  
Alessandro Rossi ◽  
Marco Barbiero ◽  
Paolo Scremin ◽  
Ruggero Carli
Keyword(s):  
Finite Number ◽  
State Of The Art ◽  
Lossless Compression ◽  
3D Models ◽  
Optimal Result ◽  
Object Space ◽  
Plücker Coordinates ◽  
Determination Methods

Industrial 3D models are usually characterized by a large number of hidden faces and it is very important to simplify them. Visible-surface determination methods provide one of the most common solutions to the visibility problem. This study presents a robust technique to address the global visibility problem in object space that guarantees theoretical convergence to the optimal result. More specifically, we propose a strategy that, in a finite number of steps, determines if each face of the mesh is globally visible or not. The proposed method is based on the use of Plücker coordinates that allows it to provide an efficient way to determine the intersection between a ray and a triangle. This algorithm does not require pre-calculations such as estimating the normal at each face: this implies the resilience to normals orientation. We compared the performance of the proposed algorithm against a state-of-the-art technique. Results showed that our approach is more robust in terms of convergence to the maximum lossless compression.

An experimental study on feature-based SLAM for multi-legged robots with RGB-D sensors

2017 ◽  
Vol 44 (4) ◽  
pp. 428-441 ◽  
Author(s):  
Michał R. Nowicki ◽  
Dominik Belter ◽  
Aleksander Kostusiak ◽  
Petr Cížek ◽  
Jan Faigl ◽  
...  
Keyword(s):  
Performance Metrics ◽  
State Of The Art ◽  
Building Blocks ◽  
Bundle Adjustment ◽  
The State ◽  
Legged Robots ◽  
Evaluation Methodology ◽  
Walking Robots ◽  
Content Type ◽  
Feature Based

Purpose This paper aims to evaluate four different simultaneous localization and mapping (SLAM) systems in the context of localization of multi-legged walking robots equipped with compact RGB-D sensors. This paper identifies problems related to in-motion data acquisition in a legged robot and evaluates the particular building blocks and concepts applied in contemporary SLAM systems against these problems. The SLAM systems are evaluated on two independent experimental set-ups, applying a well-established methodology and performance metrics. Design/methodology/approach Four feature-based SLAM architectures are evaluated with respect to their suitability for localization of multi-legged walking robots. The evaluation methodology is based on the computation of the absolute trajectory error (ATE) and relative pose error (RPE), which are performance metrics well-established in the robotics community. Four sequences of RGB-D frames acquired in two independent experiments using two different six-legged walking robots are used in the evaluation process. Findings The experiments revealed that the predominant problem characteristics of the legged robots as platforms for SLAM are the abrupt and unpredictable sensor motions, as well as oscillations and vibrations, which corrupt the images captured in-motion. The tested adaptive gait allowed the evaluated SLAM systems to reconstruct proper trajectories. The bundle adjustment-based SLAM systems produced best results, thanks to the use of a map, which enables to establish a large number of constraints for the estimated trajectory. Research limitations/implications The evaluation was performed using indoor mockups of terrain. Experiments in more natural and challenging environments are envisioned as part of future research. Practical implications The lack of accurate self-localization methods is considered as one of the most important limitations of walking robots. Thus, the evaluation of the state-of-the-art SLAM methods on legged platforms may be useful for all researchers working on walking robots’ autonomy and their use in various applications, such as search, security, agriculture and mining. Originality/value The main contribution lies in the integration of the state-of-the-art SLAM methods on walking robots and their thorough experimental evaluation using a well-established methodology. Moreover, a SLAM system designed especially for RGB-D sensors and real-world applications is presented in details.

Persistent memory hash indexes

2021 ◽  
Vol 14 (5) ◽  
pp. 785-798
Author(s):  
Daokun Hu ◽  
Zhiwen Chen ◽  
Jianbing Wu ◽  
Jianhua Sun ◽  
Hao Chen
Keyword(s):  
Future Development ◽  
High Performance ◽  
Performance Metrics ◽  
Comprehensive Evaluation ◽  
State Of The Art ◽  
Hash Tables ◽  
Trade Offs ◽  
Depth Analysis ◽  
Persistent Memory ◽  
Memory Modules

Persistent memory (PM) is increasingly being leveraged to build hash-based indexing structures featuring cheap persistence, high performance, and instant recovery, especially with the recent release of Intel Optane DC Persistent Memory Modules. However, most of them are evaluated on DRAM-based emulators with unreal assumptions, or focus on the evaluation of specific metrics with important properties sidestepped. Thus, it is essential to understand how well the proposed hash indexes perform on real PM and how they differentiate from each other if a wider range of performance metrics are considered. To this end, this paper provides a comprehensive evaluation of persistent hash tables. In particular, we focus on the evaluation of six state-of-the-art hash tables including Level hashing, CCEH, Dash, PCLHT, Clevel, and SOFT, with real PM hardware. Our evaluation was conducted using a unified benchmarking framework and representative workloads. Besides characterizing common performance properties, we also explore how hardware configurations (such as PM bandwidth, CPU instructions, and NUMA) affect the performance of PM-based hash tables. With our in-depth analysis, we identify design trade-offs and good paradigms in prior arts, and suggest desirable optimizations and directions for the future development of PM-based hash tables.

BlastFunction: A Full-stack Framework Bringing FPGA Hardware Acceleration to Cloud-native Applications

2022 ◽  
Vol 15 (2) ◽  
pp. 1-27
Author(s):  
Andrea Damiani ◽  
Giorgia Fiscaletti ◽  
Marco Bacis ◽  
Rolando Brondolin ◽  
Marco D. Santambrogio
Keyword(s):  
Heterogeneous Computing ◽  
Performance Metrics ◽  
State Of The Art ◽  
Hardware Acceleration ◽  
Standard Approach ◽  
Cloud Models ◽  
Experimental Campaign ◽  
Computing Platforms ◽  
Cloud Infrastructures

“Cloud-native” is the umbrella adjective describing the standard approach for developing applications that exploit cloud infrastructures’ scalability and elasticity at their best. As the application complexity and user-bases grow, designing for performance becomes a first-class engineering concern. As an answer to these needs, heterogeneous computing platforms gained widespread attention as powerful tools to continue meeting SLAs for compute-intensive cloud-native workloads. We propose BlastFunction, an FPGA-as-a-Service full-stack framework to ease FPGAs’ adoption for cloud-native workloads, integrating with the vast spectrum of fundamental cloud models. At the IaaS level, BlastFunction time-shares FPGA-based accelerators to provide multi-tenant access to accelerated resources without any code rewriting. At the PaaS level, BlastFunction accelerates functionalities leveraging the serverless model and scales functions proactively, depending on the workload’s performance. Further lowering the FPGAs’ adoption barrier, an accelerators’ registry hosts accelerated functions ready to be used within cloud-native applications, bringing the simplicity of a SaaS-like approach to the developers. After an extensive experimental campaign against state-of-the-art cloud scenarios, we show how BlastFunction leads to higher performance metrics (utilization and throughput) against native execution, with minimal latency and overhead differences. Moreover, the scaling scheme we propose outperforms the main serverless autoscaling algorithms in workload performance and scaling operation amount.

A robust framework for shoulder implant X-ray image classification

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Minh Thanh Vo ◽  
Anh H. Vo ◽  
Tuong Le
Keyword(s):  
Image Classification ◽  
Performance Metrics ◽  
State Of The Art ◽  
Area Under The Curve ◽  
Predictive Performance ◽  
Extraction Process ◽  
Content Type ◽  
X Ray ◽  
Robust Model ◽  
Input Dataset

PurposeMedical images are increasingly popular; therefore, the analysis of these images based on deep learning helps diagnose diseases become more and more essential and necessary. Recently, the shoulder implant X-ray image classification (SIXIC) dataset that includes X-ray images of implanted shoulder prostheses produced by four manufacturers was released. The implant's model detection helps to select the correct equipment and procedures in the upcoming surgery.Design/methodology/approachThis study proposes a robust model named X-Net to improve the predictability for shoulder implants X-ray image classification in the SIXIC dataset. The X-Net model utilizes the Squeeze and Excitation (SE) block integrated into Residual Network (ResNet) module. The SE module aims to weigh each feature map extracted from ResNet, which aids in improving the performance. The feature extraction process of X-Net model is performed by both modules: ResNet and SE modules. The final feature is obtained by incorporating the extracted features from the above steps, which brings more important characteristics of X-ray images in the input dataset. Next, X-Net uses this fine-grained feature to classify the input images into four classes (Cofield, Depuy, Zimmer and Tornier) in the SIXIC dataset.FindingsExperiments are conducted to show the proposed approach's effectiveness compared with other state-of-the-art methods for SIXIC. The experimental results indicate that the approach outperforms the various experimental methods in terms of several performance metrics. In addition, the proposed approach provides the new state of the art results in all performance metrics, such as accuracy, precision, recall, F1-score and area under the curve (AUC), for the experimental dataset.Originality/valueThe proposed method with high predictive performance can be used to assist in the treatment of injured shoulder joints.

Estimation of Design Parameters and Performance for a State-of-the-Art Turbofan

2021 ◽  
Author(s):  
Oliver Sjögren ◽  
Carlos Xisto ◽  
Tomas Grönstedt
Keyword(s):  
Performance Metrics ◽  
State Of The Art ◽  
Low Pressure ◽  
Performance Model ◽  
Cycle Performance ◽  
Civil Aviation ◽  
Design Parameters ◽  
Pressure System ◽  
Public Data ◽  
Low Pressure System

Abstract The aim of this study is to explore the possibility of matching a cycle performance model to public data on a state-of-the-art commercial aircraft engine (GEnx-1B). The study is focused on obtaining valuable information on figure of merits for the technology level of the low-pressure system and associated uncertainties. It is therefore directed more specifically towards the fan and low-pressure turbine efficiencies, the Mach number at the fan-face, the distribution of power between the core and the bypass stream as well as the fan pressure ratio. Available cycle performance data have been extracted from the engine emission databank provided by the International Civil Aviation Organization (ICAO), type certificate datasheets from the European Union Aviation Safety Agency (EASA) and the Federal Aviation Administration (FAA), as well as publicly available data from engine manufacturer. Uncertainties in the available source data are estimated and randomly sampled to generate inputs for a model matching procedure. The results show that fuel performance can be estimated with some degree of confidence. However, the study also indicates that a high degree of uncertainty is expected in the prediction of key low-pressure system performance metrics, when relying solely on publicly available data. This outcome highlights the importance of statistic-based methods as a support tool for the inverse design procedures. It also provides a better understanding on the limitations of conventional thermodynamic matching procedures, and the need to complement with methods that take into account conceptual design, cost and fuel burn.

Sign in / Sign up

Export Citation Format

Share Document