A content-guided searching algorithm for balloons
β Scribed by Jiankang Wang; Xiaobo Li
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 657 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
β¦ Synopsis
Cohen and Cohen's balloon model improves the original active contour models by providing an ability to search for distant contours. Driven by an artiΓΏcial in ating force, a balloon's searching ability is rather primitive. In previous papers, we have presented several new models that incorporate di erent cues in their searching algorithm. In this paper, we present a new method that uses local image contents to guide a balloon's searching process. Sha'ashua and Ullman's saliency map method is used to trace the strongest curve that passes through a particular pixel. This locally-derived information is then used to guide a balloon's searching process. BeneΓΏting from both a global model and locally derived cues, the combined model is faster and more robust than the original balloon model.
π SIMILAR VOLUMES
Local search is an emerging paradigm for combinatorial search which has recently been shown to be very effective for a large number of combinatorial problems. It is based on the idea of navigating the search space by iteratively stepping from one solution to one of its neighbors, which are obtained
## Abstract We present a computational protein design algorithm for finding lowβenergy sequences of fixed amino acid composition. The search algorithms used in protein design typically do not restrict amino acid composition. However, the random energy model of Shakhnovich suggests that the use of f