scholarly journals Optimal Number of Choices in Rating Contexts

2019 ◽  
Vol 3 (3) ◽  
pp. 48 ◽  
Author(s):  
Sam Ganzfried ◽  
Farzana Yusuf
Keyword(s):  
Image Processing ◽  
Theoretical Analysis ◽  
Physical Attractiveness ◽  
General Setting ◽  
Optimal Number ◽  
Large Set ◽  
Improve Performance ◽  
Underlying Space ◽  
Potential Applications ◽  
Computational Resources

In many settings, people must give numerical scores to entities from a small discrete set—for instance, rating physical attractiveness from 1–5 on dating sites, or papers from 1–10 for conference reviewing. We study the problem of understanding when using a different number of options is optimal. We consider the case when scores are uniform random and Gaussian. We study computationally when using 2, 3, 4, 5, and 10 options out of a total of 100 is optimal in these models (though our theoretical analysis is for a more general setting with k choices from n total options as well as a continuous underlying space). One may expect that using more options would always improve performance in this model, but we show that this is not necessarily the case, and that using fewer choices—even just two—can surprisingly be optimal in certain situations. While in theory for this setting it would be optimal to use all 100 options, in practice, this is prohibitive, and it is preferable to utilize a smaller number of options due to humans’ limited computational resources. Our results could have many potential applications, as settings requiring entities to be ranked by humans are ubiquitous. There could also be applications to other fields such as signal or image processing where input values from a large set must be mapped to output values in a smaller set.

Quantum generative adversarial networks for learning and loading quantum image in noisy environment

2021 ◽  
pp. 2150360
Author(s):  
Wanghao Ren ◽  
Zhiming Li ◽  
Yiming Huang ◽  
Runqiu Guo ◽  
Lansheng Feng ◽  
...  
Keyword(s):  
Image Processing ◽  
Quantum Circuit ◽  
Quantum Image Processing ◽  
Quantum Circuits ◽  
Generative Adversarial Networks ◽  
Channel Noise ◽  
Quantum Image ◽  
Adversarial Networks ◽  
Potential Applications ◽  
Classical Image

Quantum machine learning is expected to be one of the potential applications that can be realized in the near future. Finding potential applications for it has become one of the hot topics in the quantum computing community. With the increase of digital image processing, researchers try to use quantum image processing instead of classical image processing to improve the ability of image processing. Inspired by previous studies on the adversarial quantum circuit learning, we introduce a quantum generative adversarial framework for loading and learning a quantum image. In this paper, we extend quantum generative adversarial networks to the quantum image processing field and show how to learning and loading an classical image using quantum circuits. By reducing quantum gates without gradient changes, we reduced the number of basic quantum building block from 15 to 13. Our framework effectively generates pure state subject to bit flip, bit phase flip, phase flip, and depolarizing channel noise. We numerically simulate the loading and learning of classical images on the MINST database and CIFAR-10 database. In the quantum image processing field, our framework can be used to learn a quantum image as a subroutine of other quantum circuits. Through numerical simulation, our method can still quickly converge under the influence of a variety of noises.

scholarly journals Optimization of the Mashaer Shuttle-Bus Service in Hajj: Arafat-Muzdalifah Case Study

Information ◽  
2021 ◽  
Vol 12 (12) ◽  
pp. 496
Author(s):  
Omar Hussain ◽  
Emad Felemban ◽  
Faizan Ur Rehman
Keyword(s):  
Optimal Number ◽  
Improve Performance ◽  
Large Numbers ◽  
Proposed Model ◽  
Holy Places ◽  
Essential Form ◽  
Service Delays ◽  
Customer Dissatisfaction ◽  
Bus Service

Hajj, the fifth pillar of Islam, is held annually in the month of Dhul Al-Hijjah, the twelfth month, in the Islamic calendar. Pilgrims travel to Makkah and its neighbouring areas—Mina, Muzdalifah, and Arafat. Annually, about 2.5 million pilgrims perform spatiotemporally restricted rituals in these holy places that they must execute to fulfil the pilgrimage. These restrictions make the task of transportation in Hajj a big challenge. The shuttle bus service is an essential form of transport during Hajj due to its easy availability at all stages and ability to transport large numbers. The current shuttle service suffers from operational problems; this can be deduced from the service delays and customer dissatisfaction with the service. This study provides a system to help in planning the operation of the service for one of the Hajj Establishments to improve performance by determining the optimal number of buses and cycles required for each office in the Establishment. We will also present a case study in which the proposed model was applied to the non-Arab Africa Establishment shuttle service. At the same time, we will include the mechanism for extracting the information required in the tested model from the considerably large GPS data of 20,000+ buses in Hajj 2018.

scholarly journals The Number of Moves of the Largest Disc in Shortest Paths on Hanoi Graphs

10.37236/4252 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Simon Aumann ◽  
Katharina A.M. Götz ◽  
Andreas M. Hinz ◽  
Ciril Petr
Keyword(s):  
Shortest Paths ◽  
General Setting ◽  
Optimal Number ◽  
Numerical Results ◽  
Breadth First Search ◽  
Tower Of Hanoi ◽  
Optimal Paths ◽  
Widespread Interest ◽  
Binary Strings

In contrast to the widespread interest in the Frame-Stewart conjecture (FSC) about the optimal number of moves in the classical Tower of Hanoi task with more than three pegs, this is the first study of the question of investigating shortest paths in Hanoi graphs $H_p^n$ in a more general setting. Here $p$ stands for the number of pegs and $n$ for the number of discs in the Tower of Hanoi interpretation of these graphs. The analysis depends crucially on the number of largest disc moves (LDMs). The patterns of these LDMs will be coded as binary strings of length $p-1$ assigned to each pair of starting and goal states individually. This will be approached both analytically and numerically. The main theoretical achievement is the existence, at least for all $n\geqslant p(p-2)$, of optimal paths where $p-1$ LDMs are necessary. Numerical results, obtained by an algorithm based on a modified breadth-first search making use of symmetries of the graphs, lead to a couple of conjectures about some cases not covered by our ascertained results. These, in turn, may shed some light on the notoriously open FSC.

Visual Positioning in a Smartphone

2013 ◽  
pp. 575-603
Author(s):  
Laura Ruotsalainen ◽  
Heidi Kuusniemi
Keyword(s):  
Image Processing ◽  
Portable Devices ◽  
Position Change ◽  
Query Image ◽  
Visual Positioning ◽  
Related Information ◽  
Redundant Data ◽  
Reference Images ◽  
Seamless Positioning ◽  
Computational Resources

Numerous techniques for obtaining motion and location related information are needed for obtaining seamless positioning capability with smartphones. High-quality cameras are nowadays widely available in portable devices and can provide necessary redundant data about the user’s surroundings in addition to the other sensors usable for positioning purposes. In this chapter, after introducing methods of image processing related to feature extraction, applicable methods for visual positioning are discussed with state-of-the-art examples. Regardless whether the visual-based positioning is based on reference images in a database or using information obtained from consecutive images, the first steps of pre-processing are similar to obtain noiseless images for accurate calculations and to retrieve the required camera parameters. Smartphones have limited computational resources and that restricts the methods available for image processing. To carry out the visual positioning function, features in images are either matched to corresponding features in consecutive images, or to a database. Obtaining the location can be performed with matching the query image to a database of reference images equipped with location information. Alternatively, the attitude and position change can be resolved from consecutive images to provide localization augmentation that may be fused with other sensor information. When smartphones are concerned, the restricted resources however bring about challenges that are the focus in this chapter.

Visual Positioning in a Smartphone

2012 ◽  
pp. 130-158 ◽  
Author(s):  
Laura Ruotsalainen ◽  
Heidi Kuusniemi
Keyword(s):  
Image Processing ◽  
Portable Devices ◽  
Position Change ◽  
Query Image ◽  
Visual Positioning ◽  
Related Information ◽  
Redundant Data ◽  
Reference Images ◽  
Seamless Positioning ◽  
Computational Resources

Numerous techniques for obtaining motion and location related information are needed for obtaining seamless positioning capability with smartphones. High-quality cameras are nowadays widely available in portable devices and can provide necessary redundant data about the user’s surroundings in addition to the other sensors usable for positioning purposes. In this chapter, after introducing methods of image processing related to feature extraction, applicable methods for visual positioning are discussed with state-of-the-art examples. Regardless whether the visual-based positioning is based on reference images in a database or using information obtained from consecutive images, the first steps of pre-processing are similar to obtain noiseless images for accurate calculations and to retrieve the required camera parameters. Smartphones have limited computational resources and that restricts the methods available for image processing. To carry out the visual positioning function, features in images are either matched to corresponding features in consecutive images, or to a database. Obtaining the location can be performed with matching the query image to a database of reference images equipped with location information. Alternatively, the attitude and position change can be resolved from consecutive images to provide localization augmentation that may be fused with other sensor information. When smartphones are concerned, the restricted resources however bring about challenges that are the focus in this chapter.

scholarly journals Faults Detection for Photovoltaic Field Based on K-Means, Elbow, and Average Silhouette Techniques through the Segmentation of a Thermal Image

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Abdelilah Et-taleby ◽  
Mohammed Boussetta ◽  
Mohamed Benslimane
Keyword(s):  
Image Processing ◽  
Excellent Result ◽  
Clustering Algorithms ◽  
R Package ◽  
Thermal Image ◽  
Optimal Number ◽  
Number Of Clusters ◽  
Processing Methods ◽  
Clustering Quality

Clustering or grouping is among the most important image processing methods that aim to split an image into different groups. Examining the literature, many clustering algorithms have been carried out, where the K-means algorithm is considered among the simplest and most used to classify an image into many regions. In this context, the main objective of this work is to detect and locate precisely the damaged area in photovoltaic (PV) fields based on the clustering of a thermal image through the K-means algorithm. The clustering quality depends on the number of clusters chosen; hence, the elbow, the average silhouette, and NbClust R package methods are used to find the optimal number K. The simulations carried out show that the use of the K-means algorithm allows detecting precisely the faults in PV panels. The excellent result is given with three clusters that is suggested by the elbow method.

Structured Sign for Guidance of Mobile Robot

1991 ◽  
Vol 3 (5) ◽  
pp. 379-386
Author(s):  
Hesin Sai ◽  
◽  
Yoshikuni Okawa
Keyword(s):  
Image Processing ◽  
Theoretical Analysis ◽  
Mobile Robot ◽  
Mobile Robots ◽  
Personal Computer ◽  
The Other ◽  
Guidance System ◽  
Fluorescent Light ◽  
Trajectory Following ◽  
Good Coincidence

As part of a guidance system for mobile robots operating on a wide and flat floor, such as an ordinary factory or a gymnasium, we have proposed a special-purpose sign. It consists of a cylinder, with four slits, and a fluorescent light, which is placed on the axis of the cylinder. Two of the slits are parallel to each other, and the other two are angled. A robot obtains an image of the sign with a TV camera. After thresholding, we have four bright sets of pixels which correspond to the four slits of the cylinder. We compute by measuring the relative distances between the four points, the distance and the angle to the direction of the sign can be computed using simple geometrical equations. Using a personal computer with an image processing capability, we have investigated the accuracy of the proposed position identification method and compared the experimental results against the theoretical analysis of measured error. The data shows good coincidence between the analysis and the experiments. Finally, we have built a movable robot, which has three microprocessors and a TV camera, and performed several control experiments for trajectory following.

Peak Performance Training Using Prefrontal EEG Biofeedback

Biofeedback ◽  
2012 ◽  
Vol 40 (1) ◽  
pp. 7-15 ◽  
Author(s):  
Estate “Tato” Sokhadze
Keyword(s):  
Performing Arts ◽  
Biofeedback Training ◽  
Peak Performance ◽  
Improve Performance ◽  
Brain Wave ◽  
Performance Training ◽  
Wave Patterns ◽  
Potential Applications ◽  
Reasonable Approach ◽  
Human Operators

The use of biofeedback training to self-regulate EEG patterns with the aim of recovering or optimizing function and behavioral performance is becoming increasingly established. The most reasonable approach is to learn to generate and maintain optimal brain wave patterns and produce associated peak performance states on demand. We report two studies where 12 sessions of prefrontal EEG feedback were used to improve performance in both clinical and nonclinical populations. Neurofeedback using Focus, Alertness, and 40 Hz (Neureka!) measures resulted in improved selective attention and other cognitive functions. We discuss other potential applications of neurofeedback in the areas of “under-pressure” activity, where peak performance state is an essential part of the job, such as in sports or the performing arts, as well as for human operators, such as air traffic dispatchers and military personnel on duty.

Sign in / Sign up

Export Citation Format

Share Document