Search Results - (( basic computing ((means algorithm) OR (_ algorithm)) ) OR ( java implication based algorithm ))
Search alternatives:
- implication based »
- java implication »
- basic computing »
- means algorithm »
-
1
Basic firefly algorithm for document clustering
Published 2015Get full text
Get full text
Conference or Workshop Item -
2
Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications
Published 2016“…Thus, a new hybrid algorithm with higher accuracy of computation is developed in this project. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
3
-
4
System identification using Extended Kalman Filter
Published 2017Get full text
Get full text
Student Project -
5
-
6
A highly efficient algorithm for phased-array mmWave massive MIMO beamforming
Published 2021“…Simulation results show that the proposed algorithm significantly improves system performance and reduces computational complexity by more than 45% compared to traditional algorithms.…”
Get full text
Get full text
Article -
7
Enhanced Image View Synthesis Using Multistage Hybrid Median Filter For Stereo Images
Published 2018“…Disparity depth map estimation of stereo matching algorithm is one of the most active research topics in computer vision.In the field of image processing,many existing stereo matching algorithms to obtain disparity depth map are developed and designed with low accuracy.To improve the accuracy of disparity depth map is quite challenging and difficult especially with uncontrolled dynamic environment.The accuracy is affected by many unwanted aspects including random noises,horizontal streaks,low texture,depth map non-edge preserving, occlusion,and depth discontinuities.Thus,this research proposed a new robust method of hybrid stereo matching algorithm with significant accuracy of computation.The thesis will present in detail the development,design, and analysis of performance on Multistage Hybrid Median Filter (MHMF).There are two main parts involved in our developed method which combined in two main stages.Stage 1 consists of the Sum of Absolute Differences (SAD) from Basic Block Matching (BBM) algorithm and the part of Scanline Optimization (SO) from Dynamic Programming (DP) algorithm.While,Stage 2 is the main core of our MHMF as a post-processing step which included segmentation,merging, and hybrid median filtering.The significant feature of the post-processing step is on its ability to handle efficiently the unwanted aspects obtained from the raw disparity depth map on the step of optimization.In order to remove and overcome the challenges unwanted aspects, the proposed MHMF has three stages of filtering process along with the developed approaches in Stage 2 of MHMF algorithm.There are two categories of evaluation performed on the obtained disparity depth map: subjective evaluation and objective evaluation.The objective evaluation involves the evaluation on Middlebury Stereo Vision system and evaluation using traditional methods such as Mean Square Errors (MSE),Peak to Signal Noise Ratio (PSNR) and Structural Similarity Index Metric (SSIM).Based on the results of the standard benchmarking datasets from Middlebury,the proposed algorithm is able to reduce errors of non-occluded and all errors respectively.While,the subjective evaluation is done for datasets captured from MV BLUE FOX camera using human's eyes perception.Based on the results,the proposed MHMF is able to obtain accurate results, specifically 69% and 71% of non-occluded and all errors for disparity depth map, and it outperformed some of the existing methods in the literature such as BBM and DP algorithms.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
8
-
9
Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol
Published 2008“…The objectives of this research are to propose new algorithm to detect route failure as early warning message to the protocol to take further action, and to propose new algorithm for DSR route maintenance to response the early warning message from route failure detection algorithm. …”
Get full text
Get full text
Thesis -
10
-
11
-
12
Development an accurate and stable range-free localization scheme for anisotropic wireless sensor networks
Published 2022“…Besides, the weighted coefficient and centroid algorithm is employed to reduce cumulative error by hop count and cut down computational complexity. …”
Get full text
Get full text
Thesis -
13
-
14
Trust based Lightweight Security Protocol for Device to Device Multihop Cellular Communication
Published 2020“…It also achieves confidentiality, integrity and avoids any no-repudiation attack. The computational overhead shows that TLwS is at least 40% better than popular algorithm such as SeDS, UAKA-D2D, and D2D-Assist. …”
Get full text
Get full text
Thesis -
15
Blogs Search Engine Adopting RSS Syndication Using Fuzzy Logic
Published 2012“…The blogs search engine consists of three main phases which are crawling using RSS feeds algorithm, indexing weblogs algorithm and searching technique with Fuzzy logic. …”
Get full text
Get full text
Get full text
Thesis -
16
Measuring aircraft altimetry system error using automatic dependent surveillance-broadcast data / Kalyani Bahskaran
Published 2021“…This research identifies a process to measure the ASE values using ADS-B data. Subsequently, a computer algorithm and interfacing tool is developed. …”
Get full text
Get full text
Get full text
Thesis -
17
-
18
A new 128-bit block cipher
Published 2009“…The existence of this new 128-bit block cipher algorithm will increase the protection of the national information infrastructure and also will contribute as an alternative to other cryptographic algorithms in security in the computing industry.…”
Get full text
Get full text
Thesis -
19
Fuzzy C means imputation of missing values with ant colony optimization
Published 2020Get full text
Get full text
Article -
20
Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman
Published 2020“…On a smaller game map, the algorithm still takes an acceptable computing time but on a larger size map, the computation time suffers a lot. …”
Get full text
Get full text
Thesis