Search Results - (( using block method algorithm ) OR ( using optimization based algorithm ))

VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern by Angeline Teoh, Szu Fern

“…GA is a widely used optimization algorithm based on the concept of survival of the fittest. …”
Get full text
Get full text

Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman by Che Osman, Siti Eshah

“…In this study, a pattern based using Particle Swarm Optimization (PSO) is proposed named as Hexagon PSO (HPSO). …”
Get full text
Get full text

Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence by S. S. S. , Ranjit

“…Based on the theoretical and fundamental research analysis the FUHS16 and UHDS16 algorithms using 16 × 16 block-based motion estimation formulations were developed. …”
Get full text
Get full text
Get full text

Fast Template Matching Method based Optimized Sum of Absolute Difference Algorithm for Face Localization by brahim belhaouari, samir, Josefina Janier , Josefina, Nadir, Nourain

Get full text
Get full text

Teletraffic performance of mobile cellular channel assignment using genetic algorithm by Kiong T.S., Ismail M., Hassan A.

“…Genetic algorithm (GA) D. Goldberg (1989) J.H. Holland (1975) which is a well-known method in solving various types of complex mathematical is integrated into ordinary channel assignment strategies to design a conflict-free channel assignment strategy that satisfies both the electromagnetic compatibility (EMC) constraints and traffic demand requirements W.K. …”

Optimization of ANPR algorithm on android mobile phone by Mutholib, Abdul, Gunawan, Teddy Surya, Chebil, Jalel, Kartiwi, Mira

“…First, various steps to optimize ANPR and OCR block using template matching are described. …”
Get full text
Get full text
Get full text

Reduced complexity optimum detector for block data transmission systems by S. P. K., Babu, M. F. M., Salleh, Farid, Ghani

Get full text

Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

“…In this study, Simulated Kalman Filter (SKF) is applied to image template matching application as the optimization algorithm. SKF is compared with conventional algorithms for image template matching which are performance index value (PIM) and correlation by using DC components of image (TMC) and by using power of images (TMP) methods. …”
Get full text
Get full text

Resource allocation in coordinated multipoint long term evolution-advanced networks by Katiran, Norshidah

“…ORA is formulated based on Lagrangian method and optimized using Particle Swarm Optimization (PSO). …”
Get full text
Get full text

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

“…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

Solving Sudoku puzzles in Binary Integer Linear Programming using Branch and Bound algorithm / Ahida Waliyyah Ahmad Fuad by Ahmad Fuad, Ahida Waliyyah

“…Using the PuLP library in Python, the B&B algorithm is implemented to systematically explore feasible solutions while pruning infeasible branches, ensuring all Sudoku constraints are met. …”
Get full text
Get full text

Algorithm optimization and low cost bit-serial architecture design for integer-pixel and sub-pixel motion estimation in H.264/AVC / Mohammad Reza Hosseiny Fatemi by Hosseiny Fatemi, Mohammad Reza

“…To address the computational complexity and memory bandwidth requirement problems of interpolate and search method in the SME of H.264/AVC, we introduce a low complexity algorithm and its hardware architecture for SME with quarter-pixel accuracy that is based on parabolic interpolation free algorithms. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Mobility management schemes based on multiple criteria for optimization of seamless handover in long term evolution networks by Hussein, Yassein Soubhi

“…The results demonstrated that our proposed method results in significant reductions of HOF, HOPP and packet loss ratio (PLR) compared to the conventional HHO and enhanced weighted performance HO parameter optimization (EWPHPO) algorithm. …”
Get full text
Get full text

Block based low complexity iterative QR precoder structure for Massive MIMO by Mok, Li Suet

“…In this thesis, we attempt to reduce the complexity of the BD schemes by partitioning channel matrix into corresponding square matrix. We make use of QR-based BD method to precode in a lower dimension channel matrix rather than computing all of them. …”
Get full text
Get full text

Fractal coding of bio-metric image for face authentication by Ahadullah, Md

“…The key implication of these principles is that for both blocks, the symmetrical central pixel is used to search the relevant domain block rather than the entire neighborhood of the block. …”
Get full text
Get full text

A study on solution of matrix riccati differential equations using ant colony programming and simulink / Mohd Zahurin Mohamed Kamali by Mohamed Kamali, Mohd Zahurin

“…This add-on Simulink package in the Matlab software can be used to create a block of diagrams which can be translated into a system of ordinary differential equations. …”
Get full text
Get full text

Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
Get full text
Get full text
Get full text

Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra’s based greedy method. …”
Get full text
Get full text
Get full text

Use of AR Block Processing for Estimating the State Variables of Power System by Mohd Nor, Nursyarizal, Jegatheesan, Ramiah, Perumal, Nallagownden

Get full text
Get full text

Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
Get full text
Get full text
Get full text