IEEE - Institute of Electrical and Electronics Engineers, Inc. - Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path

2006 18th International Conference on Pattern Recognition

Buy Now

Regular:

Circular shortest path algorithms for polar objects segmentation have been proposed in the works of B. Appleton and C. Sun (2003, 2005) and C. Sun and S. Pallottino (2002) to address discrete case and extended in the work of B. Appleton and H. Talbot (2005) to the continuous domain for closed global optimal geodesic calculation. The best method up to date relies on a branch and bound approach and runs in O(u^1.6v) on average while O(u^1.6v) in worst case for a u times v discrete trellis warped in the direction of v. We propose an new algorithm called dichotomic multiple search (DMS) which finds the global minimum with a O(ulog₂(u)v) worst case scenario complexity. Our algorithm relies on the fact that two minimal paths never cross more than once. This allows to sequentially partition the trellis in a dichotomic manner. Each computed circular minimal path with chosen starting point allows cutting the trellis into two sub trellis. The algorithm is then recursively applied on each sub trellis. Application to object segmentation is presented

View Less

Related Documents

Image reconstruction for brain CT slices

September 1, 2004 - China Aerospace Science and Industry Corporation (CASIC)

Different modalities in biomedical images, like CT, MRI and PET scanners, provide detailed cross-sectional views of human anatomy. This paper introduces three-dimensional brain reconstruction based on CT slices. It contains filtering, fuzzy segmentation, matching method of contours, cell array struc...

Geographic information and node selfish-based routing algorithm for delay tolerant networks

June 1, 2017 - Tsinghua University Press Ltd.

In Delay Tolerant Networks (DTNs), some routing algorithms ignore that most nodes are selfish, i.e., nodes are willing to use their own resources to forward messages to nodes with whom they have a relationship. In view of this phenomenon, we propose a routing algorithm based on Geographic Informatio...

Modeling and inferring 2.1D sketch with mixed Markov random field

April 1, 2017 - China Aerospace Science and Industry Corporation (CASIC)

This paper presents a method of computing a 2.1D sketch (i.e., layered image representation) from a single image with mixed Markov random field (MRF) under the Bayesian framework. Our model consists of three layers: the input image layer, the graphical representation layer of the computed 2D atomic ...

SAR target recognition based on active contour without edges

April 1, 2017 - China Aerospace Science and Industry Corporation (CASIC)

A new method for synthetic aperture radar (SAR) target recognition is proposed. This method is accomplished via the combination of active contour without edges, Hu invariant moments and support vector machine (SVM) classifier. Image segmentation is performed by using active contour without edges. Th...

2-space bounded online cube and hypercube packing

June 1, 2015 - Tsinghua University Press Ltd.

We consider the problem of packing d-dimensional cubes into the minimum number of 2-space bounded unit cubes. Given a sequence of items, each of which is a d-dimensional (d ≥ 3) hypercube with side length not greater than 1 and an infinite number of d-dimensional (d ≥ 3) hypercube bins...

Related Products

Searching for related products...

Related Suppliers

Searching for related suppliers...

Author(s):	M. de La Gorce ; N. Paragios
Sponsor(s):	IEEE CPS
Publisher:	IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date:	1 January 2006
Conference Location:	Hong Kong, China
Conference Date:	20 August 2006
Volume:	2
Page(s):	403 - 406
ISBN (Paper):	0-7695-2521-0
ISSN (Paper):	1051-4651
DOI:	10.1109/ICPR.2006.543