scholarly journals The visual attention saliency map for movie retrospection

Open Physics ◽  
2018 ◽  
Vol 16 (1) ◽  
pp. 188-192 ◽  
Author(s):  
Anna Rogalska ◽  
Piotr Napieralski
Keyword(s):  
Computer Science ◽  
Cognitive Neuroscience ◽  
Motion Pictures ◽  
Computational Cost ◽  
Visual Saliency ◽  
Saliency Map ◽  
Robotic Systems ◽  
Scientific Disciplines ◽  
Salient Regions ◽  
Low Computational Cost

Abstract The visual saliency map is becoming important and challenging for many scientific disciplines (robotic systems, psychophysics, cognitive neuroscience and computer science). Map created by the model indicates possible salient regions by taking into consideration face presence and motion which is essential in motion pictures. By combining we can obtain credible saliency map with a low computational cost.

scholarly journals Multirobot Heterogeneous Control Considering Secondary Objectives

Sensors ◽  
2019 ◽  
Vol 19 (20) ◽  
pp. 4367
Author(s):  
Acosta ◽  
Rivera ◽  
Andaluz ◽  
Garrido
Keyword(s):  
Linear Algebra ◽  
Computational Cost ◽  
Experimental Results ◽  
Robotic Systems ◽  
Robotic Group ◽  
Secondary Tasks ◽  
Heterogeneous Robots ◽  
High Scalability ◽  
The Stability ◽  
Low Computational Cost

Cooperative robotics has considered tasks that are executed frequently, maintaining the shape and orientation of robotic systems when they fulfill a common objective, without taking advantage of the redundancy that the robotic group could present. This paper presents a proposal for controlling a group of terrestrial robots with heterogeneous characteristics, considering primary and secondary tasks thus that the group complies with the following of a path while modifying its shape and orientation at any time. The development of the proposal is achieved through the use of controllers based on linear algebra, propounding a low computational cost and high scalability algorithm. Likewise, the stability of the controller is analyzed to know the required features that have to be met by the control constants, that is, the correct values. Finally, experimental results are shown with different configurations and heterogeneous robots, where the graphics corroborate the expected operation of the proposal.

scholarly journals Computational models of mentalizing

2019 ◽  
Author(s):  
Bryan Gonzalez ◽  
Luke J. Chang
Keyword(s):  
Computer Science ◽  
Cognitive Neuroscience ◽  
General Framework ◽  
Computational Models ◽  
Mental States ◽  
Neural Recording ◽  
Building Models ◽  
Scientific Disciplines ◽  
The Future ◽  
Constrained Environments

Humans have a remarkable ability to infer and represent others’ mental states such as their beliefs, goals, desires, intentions, and feelings. In this chapter, we review some of the innovations that have developed in economics, computer science, and cognitive neuroscience in modeling the computations underlying several mentalizing operations. Broadly, this involves building models of how agents infer the mental states of other agents within constrained environments. These models include modules for: representing the goals and desires of an agent (e.g., maximize reward, or minimize embarrassment), inferring the mental states of other agents (e.g., beliefs, goals, desires, intentions, and feelings), and integrating these goals and mentalizing computations to produce optimal behavioral policies to navigate the environment. The mathematical operationalization of these constructs provides a general framework that can be validated by behavior and neural recording techniques and extended in the future by contributions from multiple scientific disciplines.

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.

scholarly journals Directional TGV-Based Image Restoration under Poisson Noise

2021 ◽  
Vol 7 (6) ◽  
pp. 99
Author(s):  
Daniela di Serafino ◽  
Germana Landi ◽  
Marco Viola
Keyword(s):  
Computed Tomography ◽  
Image Restoration ◽  
Gaussian Noise ◽  
Computational Cost ◽  
Data Fitting ◽  
Poisson Noise ◽  
Glass Fibres ◽  
Leibler Divergence ◽  
Generalized Variation ◽  
Low Computational Cost

We are interested in the restoration of noisy and blurry images where the texture mainly follows a single direction (i.e., directional images). Problems of this type arise, for example, in microscopy or computed tomography for carbon or glass fibres. In order to deal with these problems, the Directional Total Generalized Variation (DTGV) was developed by Kongskov et al. in 2017 and 2019, in the case of impulse and Gaussian noise. In this article we focus on images corrupted by Poisson noise, extending the DTGV regularization to image restoration models where the data fitting term is the generalized Kullback–Leibler divergence. We also propose a technique for the identification of the main texture direction, which improves upon the techniques used in the aforementioned work about DTGV. We solve the problem by an ADMM algorithm with proven convergence and subproblems that can be solved exactly at a low computational cost. Numerical results on both phantom and real images demonstrate the effectiveness of our approach.

scholarly journals An optimal and low computational cost fractional Newton-type method for solving nonlinear equations

2021 ◽  
pp. 107650
Author(s):  
Giro Candelario ◽  
Alicia Cordero ◽  
Juan R. Torregrosa ◽  
María P. Vassileva
Keyword(s):  
Nonlinear Equations ◽  
Computational Cost ◽  
Type Method ◽  
Low Computational Cost

An Object-Based Image Reducing Approach

2014 ◽  
Vol 1044-1045 ◽  
pp. 1049-1052 ◽  
Author(s):  
Chin Chen Chang ◽  
I Ta Lee ◽  
Tsung Ta Ke ◽  
Wen Kai Tai
Keyword(s):  
Visual Saliency ◽  
Saliency Map ◽  
Input Image ◽  
Image Size ◽  
Target Image ◽  
Feature Maps ◽  
Object Based ◽  
Wide Range

Common methods for reducing image size include scaling and cropping. However, these two approaches have some quality problems for reduced images. In this paper, we propose an image reducing algorithm by separating the main objects and the background. First, we extract two feature maps, namely, an enhanced visual saliency map and an improved gradient map from an input image. After that, we integrate these two feature maps to an importance map. Finally, we generate the target image using the importance map. The proposed approach can obtain desired results for a wide range of images.

Video Objective Quality Evaluation System Based on the Visual Saliency Map

2013 ◽  
Vol 411-414 ◽  
pp. 1362-1367 ◽  
Author(s):  
Qing Lan Wei ◽  
Yuan Zhang
Keyword(s):  
Evaluation System ◽  
Quality Evaluation ◽  
Objective Assessment ◽  
Visual Saliency ◽  
Objective Evaluation ◽  
Subjective Assessment ◽  
Saliency Map ◽  
Assessment Scores ◽  
Objective Quality ◽  
Quality Evaluation System

This paper presents the thoughts about application of saliency map to the video objective quality evaluation system. It computes the SMSE and SPSNR values as the objective assessment scores according to the saliency map, and compares with conditional objective evaluation methods as PSNR and MSE. Experimental results demonstrate that this method can well fit the subjective assessment results.

Low-Computational Cost Estimation Algorithm for Adaptive Optics Systems*

2011 ◽  
Vol 44 (1) ◽  
pp. 5573-5578
Author(s):  
M. Abbas Turki ◽  
D. Esqueda Merino ◽  
K. Kasper ◽  
C. Durieu
Keyword(s):  
Adaptive Optics ◽  
Cost Estimation ◽  
Computational Cost ◽  
Estimation Algorithm ◽  
Low Computational Cost

scholarly journals Status Estimation and In-Process Connection of Kanbans Using BLE Beacons and LPWA Network to Implement Intra-Traceability for the Kanban System

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5038
Author(s):  
Kosuke Shima ◽  
Masahiro Yamaguchi ◽  
Takumi Yoshida ◽  
Takanobu Otsuka
Keyword(s):  
Inventory Management ◽  
Low Cost ◽  
Computational Cost ◽  
Low Energy ◽  
Manufacturing Strategy ◽  
Implementation Cost ◽  
Measurement Systems ◽  
Process Route ◽  
Kanban System ◽  
Low Computational Cost

IoT-based measurement systems for manufacturing have been widely implemented. As components that can be implemented at low cost, BLE beacons have been used in several systems developed in previous research. In this work, we focus on the Kanban system, which is a measure used in manufacturing strategy. The Kanban system emphasizes inventory management and is used to produce only required amounts. In the Kanban system, the Kanban cards are rotated through the factory along with the products, and when the products change to a different process route, the Kanban card is removed from the products and the products are assigned to another Kanban. For this reason, a single Kanban cannot trace products from plan to completion. In this work, we propose a system that uses a Bluetooth low energy (BLE) beacon to connect Kanbans in different routes but assigned to the same products. The proposed method estimates the beacon status of whether the Kanban is inside or outside a postbox, which can then be computed by a micro controller at low computational cost. In addition, the system connects the Kanbans using the beacons as paired connection targets. In an experiment, we confirmed that the system connected 70% of the beacons accurately. We also confirmed that the system could connect the Kanbans at a small implementation cost.

Sign in / Sign up

Export Citation Format

Share Document