A novel approach to train random forests on GPU for computer vision applications using local features

2016 ◽  
Vol 30 (3) ◽  
pp. 290-304 ◽  
Author(s):  
Daniele Pianu ◽  
Roberto Nerino ◽  
Claudia Ferraris ◽  
Antonio Chimienti
Keyword(s):  
Computer Vision ◽  
Random Forests ◽  
Local Features ◽  
Novel Approach ◽  
Computer Vision Applications

scholarly journals A Novel adaptative Discrete Cuckoo Search Algorithm for parameter optimization in computer vision

2017 ◽  
Vol 20 (60) ◽  
pp. 51 ◽  
Author(s):  
Loubna Benchikhi ◽  
Mohamed Sadgal ◽  
Aziz Elfazziki ◽  
Fatimaezzahra Mansouri
Keyword(s):  
Computer Vision ◽  
Parameter Optimization ◽  
Expert Knowledge ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Novel Approach ◽  
Novel Method ◽  
Computer Vision Applications ◽  
Must Experiment

Computer vision applications require choosing operators and their parameters, in order to provide the best outcomes. Often, the users quarry on expert knowledge and must experiment many combinations to find manually the best one. As performance, time and accuracy are important, it is necessary to automate parameter optimization at least for crucial operators. In this paper, a novel approach based on an adaptive discrete cuckoo search algorithm (ADCS) is proposed. It automates the process of algorithms’ setting and provides optimal parameters for vision applications. This work reconsiders a discretization problem to adapt the cuckoo search algorithm and presents the procedure of parameter optimization. Some experiments on real examples and comparisons to other metaheuristic-based approaches: particle swarm optimization (PSO), reinforcement learning (RL) and ant colony optimization (ACO) show the efficiency of this novel method.

Recognition of Birds in Blurred and Illumination Images by Local Features

2017 ◽  
Vol 7 (7) ◽  
pp. 243
Author(s):  
Suresha .M ◽  
. Sandeep
Keyword(s):  
Computer Vision ◽  
Time Complexity ◽  
Feature Detection ◽  
Feature Matching ◽  
Fast Algorithms ◽  
Local Features ◽  
Experimental Demonstration ◽  
Harris Corner ◽  
Blurred Image ◽  
Blurred Images

Local features are of great importance in computer vision. It performs feature detection and feature matching are two important tasks. In this paper concentrates on the problem of recognition of birds using local features. Investigation summarizes the local features SURF, FAST and HARRIS against blurred and illumination images. FAST and Harris corner algorithm have given less accuracy for blurred images. The SURF algorithm gives best result for blurred image because its identify strongest local features and time complexity is less and experimental demonstration shows that SURF algorithm is robust for blurred images and the FAST algorithms is suitable for images with illumination.

scholarly journals A Novel Approach of Traffic Density Estimation Using CNNs and Computer Vision

2021 ◽  
Vol 5 (4) ◽  
pp. 80-84
Author(s):  
Luong Anh Tuan Nguyen ◽  
Thanh Xuan Ha
Keyword(s):  
Neural Networks ◽  
Computer Vision ◽  
Traffic Flow ◽  
Density Estimation ◽  
Traffic Density ◽  
Signal Control ◽  
Traffic Signal Control ◽  
Modern Life ◽  
Traffic Jam ◽  
Novel Approach

In modern life, we face many problems, one of which is the increasingly serious traffic jam. The cause is the large volume of vehicles, inadequate infrastructure and unreasonable distribution, and ineffective traffic signal control. This requires finding methods to optimize traffic flow, especially during peak hours. To optimize traffic flow, it is necessary to determine the traffic density at each time in the streets and intersections. This paper proposed a novel approach to traffic density estimation using Convolutional Neural Networks (CNNs) and computer vision. The experimental results with UCSD traffic dataset show that the proposed solution achieved the worst estimation rate of 98.48% and the best estimation rate of 99.01%.

An efficient hexagonal image framework using pseudo hexagonal pixel for computer vision applications

2021 ◽  
pp. 1-14
Author(s):  
Prathibha Varghese ◽  
G. Arockia Selva Saroja
Keyword(s):  
Computer Vision ◽  
Heuristic Algorithms ◽  
Ganglion Cells ◽  
Signal To Noise Ratio ◽  
Hexagonal Lattice ◽  
Display Device ◽  
Angular Correction ◽  
Nature Inspired Computing ◽  
Computer Vision Applications ◽  
Simulated Images

Nature-inspired computing has been a real source of motivation for the development of many meta-heuristic algorithms. The biological optic system can be patterned as a cascade of sub-filters from the photoreceptors over the ganglion cells in the fovea to some simple cells in the visual cortex. This spark has inspired many researchers to examine the biological retina in order to learn more about information processing capabilities. The photoreceptor cones and rods in the human fovea resemble hexagon more than a rectangular structure. However, the hexagonal meshes provide higher packing density, consistent neighborhood connectivity, and better angular correction compared to the rectilinear square mesh. In this paper, a novel 2-D interpolation hexagonal lattice conversion algorithm has been proposed to develop an efficient hexagonal mesh framework for computer vision applications. The proposed algorithm comprises effective pseudo-hexagonal structures which guarantee to keep align with our human visual system. It provides the hexagonal simulated images to visually verify without using any hexagonal capture or display device. The simulation results manifest that the proposed algorithm achieves a higher Peak Signal-to-Noise Ratio of 98.45 and offers a high-resolution image with a lesser mean square error of 0.59.

Graph Matching Techniques for Computer Vision

2013 ◽  
pp. 381-421 ◽  
Author(s):  
Mario Vento ◽  
Pasquale Foggia
Keyword(s):  
Computer Vision ◽  
Graph Matching ◽  
Reference Model ◽  
Computer Vision Applications ◽  
Matching Techniques

Many computer vision applications require a comparison between two objects, or between an object and a reference model. When the objects or the scenes are represented by graphs, this comparison can be performed using some form of graph matching. The aim of this chapter is to introduce the main graph matching techniques that have been used for computer vision, and to relate each application with the techniques that are most suited to it.

Sign in / Sign up

Export Citation Format

Share Document