Search Results - (( java implementation path algorithm ) OR ( program segmentation method algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6
  7. 7
  8. 8

    Recognition of isolated elements picture using backpropagation neural network / Melati Sabtu by Sabtu, Melati

    Published 2005
    “…For overall, the back-propagation algorithm has been proved as a method that can be used for recognition areas.…”
    Get full text
    Get full text
    Thesis
  9. 9

    Fast recovery of unknown coefficients in DCT-transformed images by Ong, Sim Ying, Li, Shujun, Wong, Kok Sheik, Tan, Kuan Yew

    Published 2017
    “…While the time complexity is polynomial, it is still too high for large images so faster methods are still desired. In this paper, we propose a fast hierarchical DCT coefficients recovery method by combining image segmentation and linear programming. …”
    Get full text
    Get full text
    Article
  10. 10

    ECONOMICAL OPTIMIZATION OF CONDUCTOR SELECTION IN PLANNING RADIAL DISTRIBUTION NETWORKS by Ab Ghani, Mohd Ruddin

    Published 1999
    “…A new computer algorithm and program is presented for selection of optimal conductor type and size for each feeder segment. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Economical optimization of conductor selection in planning radial distribution networks by Islam, S.J., Ghani, M.R.A.

    Published 1999
    “…A new computer algorithm and program is presented for selection of optimal conductor type and size for each feeder segment. …”
    Get full text
    Get full text
    Article
  12. 12

    Word segmentation of output response for sign language devices by Za'bah, Nor Farahidah, Muhammad Nazmi, Ahmad Amierul Asyraf, Azman, Amelia Wong

    Published 2020
    “…The proposed text segmentation method in this work is by using the dynamic programming and back-off algorithm, together with the probability score using word matching with an English language text corpus. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Accuracy of advanced deep learning with tensorflow and keras for classifying teeth developmental stages in digital panoramic imaging by Norhasmira, Mohammad, Anuar Mikdad, Muad, Rohana, Ahmad, Mohd Yusmiaidil, Putera Mohd Yusof

    Published 2022
    “…Results: Image segmentation using the DP-AC algorithm enhanced the visibility of the image features in the region of interest while suppressing the image’s background noise. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications by Teo, Chee Huat

    Published 2016
    “…Based on the results of evaluations, the results obtained by DSF is better than the algorithms, basic block matching and dynamic programming.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Nearfield Electromagnetic Imaging Technique For Brain Tumour Detection by Eustacius Jude, Anak Joseph Linggong

    Published 2019
    “…Two type of results exhibits in this thesis; FTBS technique and FBTS technique with image segmentation. The results obtained without image segmentations able to detect a smaller tumour. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Moving detection using cellular neural network (CNN) by Prema Latha, Subramaniam

    Published 2008
    “…The algorithm created is used to detect the ball in the images. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  18. 18
  19. 19

    Enhanced Image View Synthesis Using Multistage Hybrid Median Filter For Stereo Images by Ali Hussein Aboali, Maged Yahya

    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
  20. 20