scholarly journals Equal Baseline Camera Array—Calibration, Testbed and Applications

2021 ◽  
Vol 11 (18) ◽  
pp. 8464
Author(s):  
Adam L. Kaczmarek ◽  
Bernhard Blaschitz
Keyword(s):  
Stereo Matching ◽  
Outdoor Environment ◽  
Learning Technology ◽  
Disparity Map ◽  
Stereo Camera ◽  
Camera Array ◽  
3D Data ◽  
Novel Approach ◽  
Calibration Methods ◽  
Wide Range

This paper presents research on 3D scanning by taking advantage of a camera array consisting of up to five adjacent cameras. Such an array makes it possible to make a disparity map with a higher precision than a stereo camera, however it preserves the advantages of a stereo camera such as a possibility to operate in wide range of distances and in highly illuminated areas. In an outdoor environment, the array is a competitive alternative to other 3D imaging equipment such as Structured-light 3D scanners or Light Detection and Ranging (LIDAR). The considered kinds of arrays are called Equal Baseline Camera Array (EBCA). This paper presents a novel approach to calibrating the array based on the use of self-calibration methods. This paper also introduces a testbed which makes it possible to develop new algorithms for obtaining 3D data from images taken by the array. The testbed was released under open-source. Moreover, this paper shows new results of using these arrays with different stereo matching algorithms including an algorithm based on a convolutional neural network and deep learning technology.

scholarly journals AI Augmented Approach to Identify Shared Ideas from Large Format Public Consultation

2021 ◽  
Vol 13 (16) ◽  
pp. 9310
Author(s):  
Min-Hsien Weng ◽  
Shaoqun Wu ◽  
Mark Dyer
Keyword(s):  
Language Processing ◽  
Public Consultation ◽  
Learning Technology ◽  
Large Format ◽  
Natural Languages ◽  
Novel Approach ◽  
Public Data ◽  
Wide Range ◽  
Design Values ◽  
Using Data

Public data, contributed by citizens, stakeholders and other potentially affected parties, are becoming increasingly used to collect the shared ideas of a wider community. Having collected large quantities of text data from public consultation, the challenge is often how to interpret the dataset without resorting to lengthy time-consuming manual analysis. One approach gaining ground is the use of Natural Language Processing (NLP) technologies. Based on machine learning technology applied to analysis of human natural languages, NLP provides the opportunity to automate data analysis for large volumes of texts at a scale that would be virtually impossible to analyse manually. Using NLP toolkits, this paper presents a novel approach for identifying and visualising shared ideas from large format public consultation. The approach analyses grammatical structures of public texts to discover shared ideas from sentences comprising subject + verb + object and verb + object that express public options. In particular, the shared ideas are identified by extracting noun, verb, adjective phrases and clauses from subjects and objects, which are then categorised by urban infrastructure categories and terms. The results are visualised in a hierarchy chart and a word tree using cascade and tree views. The approach is illustrated using data collected from a public consultation exercise called “Share an Idea” undertaken in Christchurch, New Zealand, after the 2011 earthquake. The approach has the potential to upscale public participation to identify shared design values and associated qualities for a wide range of public initiatives including urban planning.

scholarly journals Disparity Map Generation from Illumination Variant Stereo Images Using Efficient Hierarchical Dynamic Programming

2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
Viral H. Borisagar ◽  
Mukesh A. Zaveri
Keyword(s):  
Dynamic Programming ◽  
Stereo Matching ◽  
Stereo Image ◽  
Stereo Pair ◽  
Image Pair ◽  
Stereo Images ◽  
Disparity Map ◽  
Illumination Variation ◽  
Matching Problem ◽  
Wide Range

A novel hierarchical stereo matching algorithm is presented which gives disparity map as output from illumination variant stereo pair. Illumination difference between two stereo images can lead to undesirable output. Stereo image pair often experience illumination variations due to many factors like real and practical situation, spatially and temporally separated camera positions, environmental illumination fluctuation, and the change in the strength or position of the light sources. Window matching and dynamic programming techniques are employed for disparity map estimation. Good quality disparity map is obtained with the optimized path. Homomorphic filtering is used as a preprocessing step to lessen illumination variation between the stereo images. Anisotropic diffusion is used to refine disparity map to give high quality disparity map as a final output. The robust performance of the proposed approach is suitable for real life circumstances where there will be always illumination variation between the images. The matching is carried out in a sequence of images representing the same scene, however in different resolutions. The hierarchical approach adopted decreases the computation time of the stereo matching problem. This algorithm can be helpful in applications like robot navigation, extraction of information from aerial surveys, 3D scene reconstruction, and military and security applications. Similarity measure SAD is often sensitive to illumination variation. It produces unacceptable disparity map results for illumination variant left and right images. Experimental results show that our proposed algorithm produces quality disparity maps for both wide range of illumination variant and invariant stereo image pair.

Disparity Map Acquisition Based on Matlab Calibration Toolbox and OpenCV Stereo Matching Algorithm

2014 ◽  
Vol 926-930 ◽  
pp. 3030-3033 ◽  
Author(s):  
Wei Gu ◽  
Jing Yin ◽  
Xiao Fang Yang ◽  
Pu Liu
Keyword(s):  
Information Acquisition ◽  
Stereo Matching ◽  
Block Matching ◽  
3D Measurement ◽  
Image Correction ◽  
Disparity Map ◽  
Matching Algorithm ◽  
3D Data ◽  
Difficult Issue

The key and difficult issue in the research of binocular vision-based 3D measurement is the accurate calibration of internal and external parameters of the camera and stereo matching. Matlab calibration is more efficient and accurate compared with manual or OpenCV calibration. In this paper, binocular camera is calibrated by Matlab calibration toolbox, and calibration parameters imported in OpenCV for follow-up image correction and stereo matching. By studying and comparing Block Matching (BM) and Graph Cut (GC) stereo matching algorithms, a disparity image of the object is obtained, thus laying foundation for follow-up 3D data information acquisition and reconstruction.

scholarly journals Responsive and Personalized Web Layouts with Integer Programming

2021 ◽  
Vol 5 (EICS) ◽  
pp. 1-23
Author(s):  
Markku Laine ◽  
Yu Zhang ◽  
Simo Santala ◽  
Jussi P. P. Jokinen ◽  
Antti Oulasvirta
Keyword(s):  
Integer Programming ◽  
Web Design ◽  
Web Pages ◽  
Web Page Design ◽  
Automated Generation ◽  
Novel Approach ◽  
Wide Range ◽  
Responsive Design ◽  
Responsive Web Design ◽  
Page Design

Over the past decade, responsive web design (RWD) has become the de facto standard for adapting web pages to a wide range of devices used for browsing. While RWD has improved the usability of web pages, it is not without drawbacks and limitations: designers and developers must manually design the web layouts for multiple screen sizes and implement associated adaptation rules, and its "one responsive design fits all" approach lacks support for personalization. This paper presents a novel approach for automated generation of responsive and personalized web layouts. Given an existing web page design and preferences related to design objectives, our integer programming -based optimizer generates a consistent set of web designs. Where relevant data is available, these can be further automatically personalized for the user and browsing device. The paper includes presentation of techniques for runtime adaptation of the designs generated into a fully responsive grid layout for web browsing. Results from our ratings-based online studies with end users (N = 86) and designers (N = 64) show that the proposed approach can automatically create high-quality responsive web layouts for a variety of real-world websites.

scholarly journals Density Guarantee on Finding Multiple Subgraphs and Subtensors

2021 ◽  
Vol 15 (5) ◽  
pp. 1-32
Author(s):  
Quang-huy Duong ◽  
Heri Ramampiaro ◽  
Kjetil Nørvåg ◽  
Thu-lan Dam
Keyword(s):  
Lower Bound ◽  
State Of The Art ◽  
The State ◽  
The Other ◽  
Exact Methods ◽  
Practical Solution ◽  
Novel Approach ◽  
Wide Range ◽  
Real World Datasets ◽  
Tensor Data

Dense subregion (subgraph & subtensor) detection is a well-studied area, with a wide range of applications, and numerous efficient approaches and algorithms have been proposed. Approximation approaches are commonly used for detecting dense subregions due to the complexity of the exact methods. Existing algorithms are generally efficient for dense subtensor and subgraph detection, and can perform well in many applications. However, most of the existing works utilize the state-or-the-art greedy 2-approximation algorithm to capably provide solutions with a loose theoretical density guarantee. The main drawback of most of these algorithms is that they can estimate only one subtensor, or subgraph, at a time, with a low guarantee on its density. While some methods can, on the other hand, estimate multiple subtensors, they can give a guarantee on the density with respect to the input tensor for the first estimated subsensor only. We address these drawbacks by providing both theoretical and practical solution for estimating multiple dense subtensors in tensor data and giving a higher lower bound of the density. In particular, we guarantee and prove a higher bound of the lower-bound density of the estimated subgraph and subtensors. We also propose a novel approach to show that there are multiple dense subtensors with a guarantee on its density that is greater than the lower bound used in the state-of-the-art algorithms. We evaluate our approach with extensive experiments on several real-world datasets, which demonstrates its efficiency and feasibility.

scholarly journals A Joint 2D-3D Complementary Network for Stereo Matching

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1430
Author(s):  
Xiaogang Jia ◽  
Wei Chen ◽  
Zhengfa Liang ◽  
Xin Luo ◽  
Mingfei Wu ◽  
...  
Keyword(s):  
Stereo Matching ◽  
Computational Cost ◽  
Research Field ◽  
Disparity Map ◽  
Improve Performance ◽  
Cost Aggregation ◽  
Disparity Range ◽  
Public Datasets ◽  
Coarse To Fine ◽  
Speed And Accuracy

Stereo matching is an important research field of computer vision. Due to the dimension of cost aggregation, current neural network-based stereo methods are difficult to trade-off speed and accuracy. To this end, we integrate fast 2D stereo methods with accurate 3D networks to improve performance and reduce running time. We leverage a 2D encoder-decoder network to generate a rough disparity map and construct a disparity range to guide the 3D aggregation network, which can significantly improve the accuracy and reduce the computational cost. We use a stacked hourglass structure to refine the disparity from coarse to fine. We evaluated our method on three public datasets. According to the KITTI official website results, Our network can generate an accurate result in 80 ms on a modern GPU. Compared to other 2D stereo networks (AANet, DeepPruner, FADNet, etc.), our network has a big improvement in accuracy. Meanwhile, it is significantly faster than other 3D stereo networks (5× than PSMNet, 7.5× than CSN and 22.5× than GANet, etc.), demonstrating the effectiveness of our method.

scholarly journals An Advanced Educational Tool for Digital Forensic Engineering

2016 ◽  
Vol 11 (03) ◽  
pp. 15 ◽  
Author(s):  
Primož Cigoj ◽  
Borka Jerman Blažič
Keyword(s):  
Digital Forensics ◽  
Real Life ◽  
University Education ◽  
Educational Tool ◽  
Digital Tool ◽  
College And University ◽  
Novel Approach ◽  
Wide Range ◽  
E Learning ◽  
Forensic Engineering

This paper presents a novel approach to education in the area of digital forensics based on a multi-platform cloud-computer infrastructure and an innovative computer based tool. The tool is installed and available through the cloud-based infrastructure of the Dynamic Forensic Education Alliance. Cloud computing provides an efficient mechanism for a wide range of services that offer real-life environments for teaching and training cybersecurity and digital forensics. The cloud-based infrastructure, the virtualized environment and the developed educational tool enable the construction of a dynamic e-learning environment making the training very close to reality and to real-life situations. The paper presents the Dynamic Forensic Digital tool named EduFors and describes the different levels of college and university education where the tool is introduced and used in the training of future investigators of cybercrime events.

Vehicle Security Distance Control Based on Binocular Parallax Vision

2014 ◽  
Vol 644-650 ◽  
pp. 207-210
Author(s):  
Shuang Liu ◽  
Xiang Jie Kong ◽  
Ming Cai Shan
Keyword(s):  
Image Processing ◽  
Computer Vision ◽  
High Precision ◽  
Stereo Matching ◽  
Vision System ◽  
Intelligent Transportation ◽  
Distance Control ◽  
Calibration Methods ◽  
Computer Vision Technology ◽  
Vehicle Security

Binocular parallax vision system is a kind of computer vision technology. Two cameras on different locations can get two different pictures of same object. The space position of the object can be calculated by the parallax information of two different pictures. The binocular parallax vision technology includes cameras calibration, image processing, and stereo matching analysis. The paper will introduce the inside and outside parameters calibration methods, and combing the traffic applications, designed the calibrating scheme. The parameters that obtained according to the scheme can meet the demands of measuring the vehicle distance. The high precision can meet the needs of intelligent transportation vehicles in a security vehicles spacing survey, which is an effective way for measuring the front car distance.

scholarly journals SWOT analysis of plant health clinics as perceived by plant doctors in Nepal

2018 ◽  
pp. 137-146
Author(s):  
R. K. Adhikari ◽  
P. P. Regmi ◽  
R. B Thapa ◽  
Y. D. G.C. ◽  
E. Boa
Keyword(s):  
Online Survey ◽  
Swot Analysis ◽  
Plant Health ◽  
Survey Tool ◽  
Extension System ◽  
Health Clinics ◽  
Novel Approach ◽  
Wide Range ◽  
Plant Clinics ◽  
External Forces

 This paper identified and examined the internal and external forces that enable or inhibit the performance of plant clinics in Nepal. The study used web-based online survey tool to collect primary information. Likert scaling and indexing techniques were used on data analysis. Pretested set of questionnaires were mailed to 209 plant doctors and the response rate was 54.54%. Being ninth country to initiate plant health clinics, Nepal is successful to adapt this novel approach into the existing extension system. It has increased access to plant health services by providing wide range of services at a place. However,limited understanding and only profit motive of local private agro-vet and input dealers has created some biased-understanding and un-trust with clinic organizers. This SWOT analysis clearly spells the scope of plant clinics to fulfill the gap between farmers need and existing services provided by public extension system.Journal of the Institute of Agriculture and Animal Science.Vol. 33-34, 2015, page: 137-146

Sign in / Sign up

Export Citation Format

Share Document