Image-based scene recognition for robot navigation considering traversable plants and its manual annotation-free training

Aims and Objective: The idea of partition and resolving sets plays an important role in various areas of engineering, chemistry and computer science such as robot navigation, facility location, pharmaceutical chemistry, combinatorial optimization, networking, and mastermind game. Method: In a graph to obtain the exact location of a required vertex which is unique from all the vertices, several vertices are selected this is called resolving set and its generalization is called resolving partition, where selected vertices are in the form of subsets. Minimum number of partitions of the vertices into sets is called partition dimension. Results: It was proved that determining the partition dimension a graph is nondeterministic polynomial time (NP) problem. In this article, we find the partition dimension of convex polytopes and provide their bounds. Conclusion: The major contribution of this article is that, due to the complexity of computing the exact partition dimension we provides the bounds and show that all the graphs discussed in results have partition dimension either less or equals to 4, but it cannot been be greater than 4.

Download Full-text

Towards an Understanding of the Effect of Night Vision Display Imagery on Scene Recognition~!2009-06-09~!2009-09-11~!2009-12-24~!

The Ergonomics Open Journal ◽

10.2174/1875934300902030150 ◽

2010 ◽

Vol 2 (3) ◽

pp. 150-158

Author(s):

Geoffrey W. Stuart ◽

Philip K. Hughes

Keyword(s):

Scene Recognition ◽

Night Vision

Download Full-text

Real-time road edge following for mobile robot navigation

Electronics & Communications Engineering Journal ◽

10.1049/ecej:19900010 ◽

1990 ◽

Vol 2 (1) ◽

pp. 35 ◽

Cited By ~ 5

Author(s):

R.A. Lotufo ◽

A.D. Morgan ◽

E.L. Dagless ◽

D.J. Milford ◽

J.F. Morrissey ◽

...

Keyword(s):

Mobile Robot ◽

Real Time ◽

Robot Navigation ◽

Mobile Robot Navigation

Download Full-text

Design of Desktop Audiovisual Entertainment System with Deep Learning and Haptic Sensations

Symmetry ◽

10.3390/sym12101718 ◽

2020 ◽

Vol 12 (10) ◽

pp. 1718

Author(s):

Chien-Hsing Chou ◽

Yu-Sheng Su ◽

Che-Ju Hsu ◽

Kong-Chang Lee ◽

Ping-Hsuan Han

Keyword(s):

Deep Learning ◽

Object Detection ◽

User Experience ◽

Recognition System ◽

Scene Recognition ◽

Single Shot ◽

Auditory Signals ◽

Hot Weather ◽

Viewing Experience ◽

At Home

In this study, we designed a four-dimensional (4D) audiovisual entertainment system called Sense. This system comprises a scene recognition system and hardware modules that provide haptic sensations for users when they watch movies and animations at home. In the scene recognition system, we used Google Cloud Vision to detect common scene elements in a video, such as fire, explosions, wind, and rain, and further determine whether the scene depicts hot weather, rain, or snow. Additionally, for animated videos, we applied deep learning with a single shot multibox detector to detect whether the animated video contained scenes of fire-related objects. The hardware module was designed to provide six types of haptic sensations set as line-symmetry to provide a better user experience. After the system considers the results of object detection via the scene recognition system, the system generates corresponding haptic sensations. The system integrates deep learning, auditory signals, and haptic sensations to provide an enhanced viewing experience.

Download Full-text

Power graphs and exchange property for resolving sets

Open Mathematics ◽

10.1515/math-2019-0093 ◽

2019 ◽

Vol 17 (1) ◽

pp. 1303-1309 ◽

Cited By ~ 1

Author(s):

Ghulam Abbas ◽

Usman Ali ◽

Mobeen Munir ◽

Syed Ahtsham Ul Haq Bokhary ◽

Shin Min Kang

Keyword(s):

Present Article ◽

Linear Algebra ◽

Finite Groups ◽

Robot Navigation ◽

Simple Graph ◽

Exchange Property ◽

Metric Dimension ◽

Sufficient Condition ◽

Resolving Set ◽

Dihedral Groups

Abstract Classical applications of resolving sets and metric dimension can be observed in robot navigation, networking and pharmacy. In the present article, a formula for computing the metric dimension of a simple graph wihtout singleton twins is given. A sufficient condition for the graph to have the exchange property for resolving sets is found. Consequently, every minimal resolving set in the graph forms a basis for a matriod in the context of independence defined by Boutin [Determining sets, resolving set and the exchange property, Graphs Combin., 2009, 25, 789-806]. Also, a new way to define a matroid on finite ground is deduced. It is proved that the matroid is strongly base orderable and hence satisfies the conjecture of White [An unique exchange property for bases, Linear Algebra Appl., 1980, 31, 81-91]. As an application, it is shown that the power graphs of some finite groups can define a matroid. Moreover, we also compute the metric dimension of the power graphs of dihedral groups.

Download Full-text