Real-time parking slot availability for Bhavnagar, using statistical block matching approach

2020 ◽  
Vol 17 (6) ◽  
pp. 811-821
Author(s):  
Janak D. Trivedi ◽  
Sarada Devi Mandalapu ◽  
Dhara H. Dave
Keyword(s):  
Real Time ◽  
Region Of Interest ◽  
Mean Value ◽  
Block Matching ◽  
Computational Time ◽  
Maintenance Cost ◽  
Content Type ◽  
Block Matching Algorithm ◽  
The Difference ◽  
Parking Place

Purpose The purpose of this paper is to find a real-time parking location for a four-wheeler. Design/methodology/approach Real-time parking availability using specific infrastructure requires a high cost of installation and maintenance cost, which is not affordable to all urban cities. The authors present statistical block matching algorithm (SBMA) for real-time parking management in small-town cities such as Bhavnagar using an in-built surveillance CCTV system, which is not installed for parking application. In particular, data from a camera situated in a mall was used to detect the parking status of some specific parking places using a region of interest (ROI). The method proposed computes the mean value of the pixels inside the ROI using blocks of different sizes (8 × 10 and 20 × 35), and the values were compared among different frames. When the difference between frames is more significant than a threshold, the process generates “no parking space for that place.” Otherwise, the method yields “parking place available.” Then, this information is used to print a bounding box on the parking places with the color green/red to show the availability of the parking place. Findings The real-time feedback loop (car parking positions) helps the presented model and dynamically refines the parking strategy and parking position to the users. A whole-day experiment/validation is shown in this paper, where the evaluation of the method is performed using pattern recognition metrics for classification: precision, recall and F1 score. Originality/value The authors found real-time parking availability for Himalaya Mall situated in Bhavnagar, Gujarat, for 18th June 2018 video using the SBMA method with accountable computational time for finding parking slots. The limitations of the presented method with future implementation are discussed at the end of this paper.

REAL-TIME OBJECT TRACKING IN MOVING CAMERA

2006 ◽  
Vol 03 (01) ◽  
pp. 61-67
Author(s):  
BYOUNG-JU YUN ◽  
JOONG-HOON CHO ◽  
JAE-WOO JEONG
Keyword(s):  
Object Tracking ◽  
Real Time ◽  
Region Of Interest ◽  
Block Matching ◽  
Camera Motion ◽  
Moving Camera ◽  
Block Matching Algorithm ◽  
Difference Image ◽  
Human Figure ◽  
The Difference

Moving object tracking plays an important role in applications of object based video conference, video surveillance and so on. The computational complexity is very important in real-time object tracking. We assumed that the background scene is obtained before an object appears in the image and a camera moves after the object is detected. The proposed method can segment an object by using the difference image if there is no camera motion. After camera motion, it can track the object by using the backward BMA (block matching algorithm) with the HFM (human figure model). For real-time tracking, we used the ROI (region of interest) which is the tightest rectangle of the object. The simulation results show that the proposed method efficiently recognizes and tracks the moving camera as well as the fixed camera.

scholarly journals A Modified KNN Algorithm for High-Performance Computing on FPGA of Real-Time m-QAM Demodulators

Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 627
Author(s):  
David Marquez-Viloria ◽  
Luis Castano-Londono ◽  
Neil Guerrero-Gonzalez
Keyword(s):  
Real Time ◽  
High Performance ◽  
Interference Mitigation ◽  
Parallel Implementation ◽  
Computational Time ◽  
Successful Implementation ◽  
Interchannel Interference ◽  
The Difference ◽  
High Level ◽  
Performance Computing

A methodology for scalable and concurrent real-time implementation of highly recurrent algorithms is presented and experimentally validated using the AWS-FPGA. This paper presents a parallel implementation of a KNN algorithm focused on the m-QAM demodulators using high-level synthesis for fast prototyping, parameterization, and scalability of the design. The proposed design shows the successful implementation of the KNN algorithm for interchannel interference mitigation in a 3 × 16 Gbaud 16-QAM Nyquist WDM system. Additionally, we present a modified version of the KNN algorithm in which comparisons among data symbols are reduced by identifying the closest neighbor using the rule of the 8-connected clusters used for image processing. Real-time implementation of the modified KNN on a Xilinx Virtex UltraScale+ VU9P AWS-FPGA board was compared with the results obtained in previous work using the same data from the same experimental setup but offline DSP using Matlab. The results show that the difference is negligible below FEC limit. Additionally, the modified KNN shows a reduction of operations from 43 percent to 75 percent, depending on the symbol’s position in the constellation, achieving a reduction 47.25% reduction in total computational time for 100 K input symbols processed on 20 parallel cores compared to the KNN algorithm.

HIGH PERFORMANCE, LOW-COMPLEXITY LINE-BASED MOTION ESTIMATION ALGORITHM WITH SMOOTHING AND PREPROCESSING

2009 ◽  
Vol 23 (01) ◽  
pp. 101-114 ◽  
Author(s):  
LI WERN CHEW ◽  
WAI CHONG CHIA ◽  
LI-MINN ANG ◽  
KAH PHOOI SENG
Keyword(s):  
Motion Estimation ◽  
High Performance ◽  
Reference Frames ◽  
Estimation Algorithm ◽  
Low Complexity ◽  
Block Matching ◽  
Absolute Difference ◽  
Current Frame ◽  
Block Matching Algorithm ◽  
The Difference

This paper introduces a smoothing and preprocessing (S+P) technique for a line-based one-bit-transform (1BT) motion estimation scheme. In the proposed algorithm, a smoothing threshold ( Threshold S) is incorporated into the 1BT convolutional kernel. By using the smoothing threshold, scattering noise which is a common problem in most 1BT images can be greatly reduced. After the transformation, the 1BT images for the current and reference frames are divided into a number of macroblocks. The macroblock in the current frame is first compared with the macroblock at the same position in the reference frame. If the Sum of Absolute Difference (SAD) is below a certain preprocessing threshold ( Threshold P), the macroblock in the current frame is considered to have negligible movement and motion search is not performed. Simulation results show that this technique achieves high performance and greatly reduces the number of search operations. By incorporating the S+P technique, the PSNR achieved by the 1BT is approaches the performance of the 8-bit Full Search Block Matching Algorithm (FSBMA), and the difference is as low as 0.08 dB. In addition, this technique outperforms current state-of-the-art 1BT motion estimation techniques. An improvement in PSNR performance by up to 0.6 dB and a reduction in the number of search operations by 60% to 93% is achieved using video conferencing sequences.

Speeding up estimation of the Hurst exponent by a two-stage procedure from a large to small range

2017 ◽  
Vol 34 (1) ◽  
pp. 3-17 ◽  
Author(s):  
Yen-Ching Chang
Keyword(s):  
Discrete Time ◽  
Hurst Exponent ◽  
Estimation Procedure ◽  
Computational Time ◽  
Small Range ◽  
Two Stage ◽  
Content Type ◽  
Computational Performance ◽  
The Difference ◽  
Stage Estimation

Purpose The Hurst exponent has been very important in telling the difference between fractal signals and explaining their significance. For estimators of the Hurst exponent, accuracy and efficiency are two inevitable considerations. The main purpose of this study is to raise the execution efficiency of the existing estimators, especially the fast maximum likelihood estimator (MLE), which has optimal accuracy. Design/methodology/approach A two-stage procedure combining a quicker method and a more accurate one to estimate the Hurst exponent from a large to small range will be developed. For the best possible accuracy, the data-induction method is currently ideal for the first-stage estimator and the fast MLE is the best candidate for the second-stage estimator. Findings For signals modeled as discrete-time fractional Gaussian noise, the proposed two-stage estimator can save up to 41.18 per cent the computational time of the fast MLE while remaining almost as accurate as the fast MLE, and even for signals modeled as discrete-time fractional Brownian motion, it can also save about 35.29 per cent except for smaller data sizes. Originality/value The proposed two-stage estimation procedure is a novel idea. It can be expected that other fields of parameter estimation can apply the concept of the two-stage estimation procedure to raise computational performance while remaining almost as accurate as the more accurate of two estimators.

scholarly journals Fast body part segmentation and tracking of neonatal video data using deep learning

2020 ◽  
Vol 58 (12) ◽  
pp. 3049-3061
Author(s):  
Christoph Hoog Antink ◽  
Joana Carlos Mesquita Ferreira ◽  
Michael Paul ◽  
Simon Lyra ◽  
Konrad Heimann ◽  
...  
Keyword(s):  
Deep Learning ◽  
Real Time ◽  
Neonatal Intensive Care ◽  
Near Infrared ◽  
Data Augmentation ◽  
Region Of Interest ◽  
Semantic Segmentation ◽  
Body Part ◽  
Video Data ◽  
Computational Time

AbstractPhotoplethysmography imaging (PPGI) for non-contact monitoring of preterm infants in the neonatal intensive care unit (NICU) is a promising technology, as it could reduce medical adhesive-related skin injuries and associated complications. For practical implementations of PPGI, a region of interest has to be detected automatically in real time. As the neonates’ body proportions differ significantly from adults, existing approaches may not be used in a straightforward way, and color-based skin detection requires RGB data, thus prohibiting the use of less-intrusive near-infrared (NIR) acquisition. In this paper, we present a deep learning-based method for segmentation of neonatal video data. We augmented an existing encoder-decoder semantic segmentation method with a modified version of the ResNet-50 encoder. This reduced the computational time by a factor of 7.5, so that 30 frames per second can be processed at 960 × 576 pixels. The method was developed and optimized on publicly available databases with segmentation data from adults. For evaluation, a comprehensive dataset consisting of RGB and NIR video recordings from 29 neonates with various skin tones recorded in two NICUs in Germany and India was used. From all recordings, 643 frames were manually segmented. After pre-training the model on the public adult data, parts of the neonatal data were used for additional learning and left-out neonates are used for cross-validated evaluation. On the RGB data, the head is segmented well (82% intersection over union, 88% accuracy), and performance is comparable with those achieved on large, public, non-neonatal datasets. On the other hand, performance on the NIR data was inferior. By employing data augmentation to generate additional virtual NIR data for training, results could be improved and the head could be segmented with 62% intersection over union and 65% accuracy. The method is in theory capable of performing segmentation in real time and thus it may provide a useful tool for future PPGI applications.

A COMPUTATIONAL-RAM (C-RAM) ARCHITECTURE FOR REAL-TIME MESH-BASED VIDEO MOTION TRACKING PART 1: MOTION ESTIMATION

2004 ◽  
Vol 13 (06) ◽  
pp. 1203-1215
Author(s):  
MOHAMMED SAYED ◽  
WAEL BADAWY
Keyword(s):  
Motion Estimation ◽  
Real Time ◽  
Motion Tracking ◽  
Cmos Technology ◽  
Block Matching ◽  
Video Frame ◽  
Clock Frequency ◽  
Motion Vectors ◽  
Mesh Structure ◽  
Block Matching Algorithm

This paper presents a new Computational-RAM (C-RAM) architecture for real-time mesh-based video motion tracking. The motion tracking consists of two operations: mesh-based motion estimation and compensation. The proposed motion estimation architecture is presented in Part 1 and the proposed motion compensation architecture is presented in Part 2. The motion estimation architecture stores two frames and computes motion vectors for a regular triangular mesh structure as defined by MPEG-4 Part 2.1 The motion estimation architecture uses the block-matching algorithm (BMA) to estimate the vertical and horizontal motion vectors for each mesh node. Parallel and pipelined implementations have been used to overcome the huge computational requirements of the motion estimation process. The two frames are stored in embedded S-RAMs generated with Virage™ Memory Compiler. The proposed motion estimation architecture has been prototyped, simulated and synthesized using the TSMC 0.18 μm CMOS technology. At 100 MHz clock frequency, the proposed architecture processes one CIF video frame (i.e., 352×288 pixels) in 1.48 ms, which means it can process up to 675 frames per second. The core area of the proposed motion estimation architecture is 24.58 mm2 and it consumes 46.26 mW.

Sign in / Sign up

Export Citation Format

Share Document