Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Greedy Approach

Handbook of Research on Natural Computing for Optimization Problems
A greedy algorithm is a mathematical procedure that looks for simple, easy-to-implement solutions to complex, multi-step problems by deciding which next step will provide the most obvious benefit.
Published in Chapter:
Active Contour Model for Medical Applications
Ritam Saha (Tripura University, India) and Mrinal Kanti Bhowmik (Tripura University, India)
DOI: 10.4018/978-1-5225-0058-2.ch038
Abstract
Recent developments in medical imaging techniques have brought an entirely new research field. Medical images are frequently corrupted by inherent noise and artifacts that could make it difficult to extract accurate information, and hence compromising the quality of clinical examination. So accurate detection is one of the major problems for medical image segmentation. Snakes or Active contour method have gained wide attention in medical image segmentation for a long time. A Snake is an energy-minimizing spline that controlled by an external energy and influenced by image energy that pull it towards features such as lines and edges. One of the key difficulties with traditional active contour algorithms is a large capture range problem. The contribution of this paper is that to in-depth analysis of the existing different contour models and implementation of techniques with minor improvements that to solve the large capture range problem. The experiment results of this model attain high accuracy detection and outperform the classical snake model in terms of efficiency and robustness.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR