scholarly journals A Time-Consistent Video Segmentation Algorithm Designed for Real-Time Implementation

VLSI Design ◽  
2008 ◽  
Vol 2008 ◽  
pp. 1-12 ◽  
Author(s):  
M. El Hassani ◽  
S. Jehan-Besson ◽  
L. Brun ◽  
M. Revenu ◽  
M. Duranton ◽  
...  
Keyword(s):  
Real Time ◽  
Video Segmentation ◽  
Computational Cost ◽  
Segmentation Algorithm ◽  
Motion Information ◽  
Temporal Consistency ◽  
Merging Process ◽  
Specific Order ◽  
Previous Frame ◽  
Low Computational Cost

We propose a time-consistent video segmentation algorithm designed for real-time implementation. Our algorithm is based on a region merging process that combines both spatial and motion information. The spatial segmentation takes benefit of an adaptive decision rule and a specific order of merging. Our method has proven to be efficient for the segmentation of natural images with few parameters to be set. Temporal consistency of the segmentation is ensured by incorporating motion information through the use of an improved change-detection mask. This mask is designed using both illumination differences between frames and region segmentation of the previous frame. By considering both pixel and region levels, we obtain a particularly efficient algorithm at a low computational cost, allowing its implementation in real-time on the TriMedia processor for CIF image sequences.

scholarly journals Fast Image Registration for Spacecraft Autonomous Navigation Using Natural Landmarks

2018 ◽  
Vol 2018 ◽  
pp. 1-12
Author(s):  
Yun-Hua Wu ◽  
Lin-Lin Ge ◽  
Feng Wang ◽  
Bing Hua ◽  
Zhi-Ming Chen ◽  
...  
Keyword(s):  
Image Registration ◽  
Autonomous Navigation ◽  
Computational Cost ◽  
Segmentation Algorithm ◽  
Speeded Up Robust Features ◽  
Speed Up ◽  
Random Sample Consensus ◽  
Invariant Properties ◽  
Low Computational Cost ◽  
Ransac Algorithm

In order to satisfy the real-time requirement of spacecraft autonomous navigation using natural landmarks, a novel algorithm called CSA-SURF (chessboard segmentation algorithm and speeded up robust features) is proposed to improve the speed without loss of repeatability performance of image registration progress. It is a combination of chessboard segmentation algorithm and SURF. Here, SURF is used to extract the features from satellite images because of its scale- and rotation-invariant properties and low computational cost. CSA is based on image segmentation technology, aiming to find representative blocks, which will be allocated to different tasks to speed up the image registration progress. To illustrate the advantages of the proposed algorithm, PCA-SURF, which is the combination of principle component analysis and SURF, is also analyzed in this paper for comparison. Furthermore, random sample consensus (RANSAC) algorithm is applied to eliminate the false matches for further accuracy improvement. The simulation results show that the proposed strategy obtains good results, especially in scaling and rotation variation. Besides, CSA-SURF decreased 50% of the time in extraction and 90% of the time in matching without losing the repeatability performance by comparing with SURF algorithm. The proposed method has been demonstrated as an alternative way for image registration of spacecraft autonomous navigation using natural landmarks.

scholarly journals High Quality - Low Computational Cost Technique for Automated Principal Object Segmentation Applied in Solar and Medical Imaging

2016 ◽  
Vol 9 (2) ◽  
pp. 23 ◽  
Author(s):  
Sofyan M. A. Hayajneh ◽  
AbdulRahman Rashad ◽  
Omar A. Saraereh ◽  
Obaida Al hazaimeh
Keyword(s):  
Real Time ◽  
Computational Cost ◽  
Real Life ◽  
Morphological Operation ◽  
Detection Process ◽  
Good Potential ◽  
Bit Plane ◽  
Noisy Background ◽  
Low Computational Cost ◽  
Bit Plane Slicing

The objective of this paper is to introduce a fully computerized, simple and low-computational cost technique that can be used in the preprocessing stages of digital images. This technique is specially designed to detect the principal (largest) closed shape object that embody the useful information in certain image types and neglect and avoid other noisy objects and artifacts. The detection process starts by calculating certain statistics of the image to estimate the amount of bit-plane slicing required to exclude the non-informative and noisy background. A simple closing morphological operation is then applied and followed by circular filter applied only on the outer coarse edge to finalize the detection process.  The proposed technique takes its importance from the huge explosion of images that need accurate processing in real time speedy manner. The proposed technique is implemented using MATLAB and tested on many solar and medical images; it was shown by the quantitative evaluation that the proposed technique can handle real-life (e.g. solar, medical fundus) images and shows very good potential even under noisy and artifacts conditions. Compared to the publicly available datasets, 97% and 99% of similarity detection is achieved in medical and solar images, respectively. Although it is well-know, the morphological bit-plane slicing technique is hoped to be used in the preprocessing stages of different applications to ease the subsequent image processing stages especially in real time applications where the proposed technique showed dramatic (~100 times) saving in processing time.

scholarly journals Whole-Body Joint Angle Estimation for Real-Time Humanoid Robot Imitation Based on Gaussian Process Dynamical Model and Particle Filter

2019 ◽  
Vol 10 (1) ◽  
pp. 5
Author(s):  
Jian Mi ◽  
Yasutake Takahashi
Keyword(s):  
Particle Filter ◽  
Real Time ◽  
Humanoid Robot ◽  
Joint Angle ◽  
Computational Cost ◽  
High Dimensional ◽  
Motion Model ◽  
Joint Angles ◽  
Compact State ◽  
Low Computational Cost

Real-time imitation enables a humanoid robot to mirror the behavior of humans, being important for applications of human–robot interaction. For imitation, the corresponding joint angles of the humanoid robot should be estimated. Generally, a humanoid robot comprises dozens of joints that construct a high-dimensional exploration space for estimating the joint angles. Although a particle filter can estimate the robot state and provides a solution for estimating joint angles, the computational cost becomes prohibitive given the high dimension of the exploration space. Furthermore, a particle filter can only estimate the joint angles accurately using a motion model. To realize accurate joint angle estimation at low computational cost, Gaussian process dynamical models (GPDMs) can be adopted. Specifically, a compact state space can be constructed through the GPDM learning of high-dimensional time-series motion data to obtain a suitable motion model. We propose a GPDM-based particle filter using a compact state space from the learned motion models to realize efficient estimation of joint angles for robot imitation. Simulations and real experiments demonstrate that the proposed method efficiently estimates humanoid robot joint angles at low computational cost, enabling real-time imitation.

High Speed Method for CCT Estimation: Fundamental, Implemention and Application in Real-Time Simulation

2017 ◽  
Vol 18 (4) ◽  
Author(s):  
Mehdi Zareian Jahromi ◽  
Shahram Montaser Kouhsari
Keyword(s):  
Kinetic Energy ◽  
Power Systems ◽  
Real Time ◽  
High Speed ◽  
Transient Stability ◽  
Computational Cost ◽  
Time Simulation ◽  
Clearing Time ◽  
Low Computational Cost ◽  
Real Time Application

AbstractThis paper proposes a hybrid method based on corrected kinetic energy to determine the critical clearing time. The proposed method structure has been implemented utilizing network preserving model to take details of power systems into consideration. To implement proposed method, the initial critical point is estimated using new concept of equal area criterion. Critical corrected kinetic energy is obtained using method which determines the amount of severity of generator contribution in a fault scenario. Due to the latter, the behavior of AVR and governor are taken into account. From initial and corrected kinetic energy of generators and consequently system, high precision critical clearing time is calculated. In order to validate the proposed method, some comprehensive case studies have been conducted on the IEEE9-bus, IEEE39-bus and IEEE68-bus test systems. Some comprehensiveness in considering the details, simplicity in implementation and low computational cost are the outstanding features of the proposed approach. Also, simulation results approve that the proposed approach can be used in real-time application without loss of any detail in transient stability assessment.

scholarly journals A Time-Consistent Video Segmentation Algorithm designed for Real-Time Implementation

2006 ◽  
Author(s):  
Mohammed El Hassani ◽  
Delphine Rivasseau ◽  
Stephanie Jehan-Besson ◽  
Marinette Revenu ◽  
David Tschumperle ◽  
...  
Keyword(s):  
Real Time ◽  
Video Segmentation ◽  
Segmentation Algorithm

scholarly journals Adaptive single-channel EEG artifact removal with applications to clinical monitoring

2021 ◽  
Author(s):  
Matteo Dora ◽  
David holcman
Keyword(s):  
Real Time ◽  
Single Channel ◽  
Low Cost ◽  
Computational Cost ◽  
Clinical Monitoring ◽  
Artifact Removal ◽  
Anesthesia Monitoring ◽  
Data Driven Approach ◽  
Movement Artifacts ◽  
Low Computational Cost

Objective: Electroencephalography (EEG) has become very common in clinical practice due to its relatively low cost, ease of installation, non-invasiveness, and good temporal resolution. Portable EEG devices are increasingly popular in clinical monitoring applications such as sleep scoring or anesthesia monitoring. In these situations, for reasons of speed and simplicity only few electrodes are used and contamination of the EEG signal by artifacts is inevitable. Visual inspection and manual removal of artifacts is often not possible, especially in real-time applications. Our goal is to develop a flexible technique to remove EEG artifacts in these contexts with minimal supervision. Methods: We propose here a new wavelet-based method which allows to remove artifacts from single-channel EEGs. The method is based on a datadriven renormalization of the wavelet components and is capable of adaptively attenuate artifacts of different nature. We benchmark our method against alternative artifact removal techniques. Results: We assessed the performance of the proposed method on publicly available datasets comprising ocular, muscular, and movement artifacts. The proposed method shows superior performances on different kinds of artifacts and signal-to-noise levels. Finally, we present an application of our method to the monitoring of general anesthesia. Conclusions: We show that our method can successfully attenuate various types of artifacts in single-channel EEG. Significance: Thanks to its data-driven approach and low computational cost, the proposed method provides a valuable tool to remove artifacts in real-time EEG applications with few electrodes, such as monitoring in special care units.

Sky Segmentation for Enhanced Depth Reconstruction and Bokeh Rendering with Efficient Architectures

2020 ◽  
Vol 2020 (14) ◽  
pp. 378-1-378-7
Author(s):  
Tyler Nuanes ◽  
Matt Elsey ◽  
Radek Grzeszczuk ◽  
John Paul Shen
Keyword(s):  
Real Time ◽  
Mobile Device ◽  
Computational Cost ◽  
False Positives ◽  
Compact Model ◽  
High Quality ◽  
False Negatives ◽  
Trade Off ◽  
Depth Reconstruction ◽  
Binary Classifiers

We present a high-quality sky segmentation model for depth refinement and investigate residual architecture performance to inform optimally shrinking the network. We describe a model that runs in near real-time on mobile device, present a new, highquality dataset, and detail a unique weighing to trade off false positives and false negatives in binary classifiers. We show how the optimizations improve bokeh rendering by correcting stereo depth misprediction in sky regions. We detail techniques used to preserve edges, reject false positives, and ensure generalization to the diversity of sky scenes. Finally, we present a compact model and compare performance of four popular residual architectures (ShuffleNet, MobileNetV2, Resnet-101, and Resnet-34-like) at constant computational cost.

scholarly journals Computing Expectiles Using k-Nearest Neighbours Approach

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 645
Author(s):  
Muhammad Farooq ◽  
Sehrish Sarfraz ◽  
Christophe Chesneau ◽  
Mahmood Ul Hassan ◽  
Muhammad Ali Raza ◽  
...  
Keyword(s):  
Computational Cost ◽  
Real Life ◽  
Distance Measures ◽  
Computational Time ◽  
High Dimensional ◽  
Test Error ◽  
Nearest Neighbours ◽  
Comparable Performance ◽  
Asymmetric Least Squares ◽  
Low Computational Cost

Expectiles have gained considerable attention in recent years due to wide applications in many areas. In this study, the k-nearest neighbours approach, together with the asymmetric least squares loss function, called ex-kNN, is proposed for computing expectiles. Firstly, the effect of various distance measures on ex-kNN in terms of test error and computational time is evaluated. It is found that Canberra, Lorentzian, and Soergel distance measures lead to minimum test error, whereas Euclidean, Canberra, and Average of (L1,L∞) lead to a low computational cost. Secondly, the performance of ex-kNN is compared with existing packages er-boost and ex-svm for computing expectiles that are based on nine real life examples. Depending on the nature of data, the ex-kNN showed two to 10 times better performance than er-boost and comparable performance with ex-svm regarding test error. Computationally, the ex-kNN is found two to five times faster than ex-svm and much faster than er-boost, particularly, in the case of high dimensional data.

Sign in / Sign up

Export Citation Format

Share Document