Do We Need a Stack to Erase a Component in a Binary Image?
スポンサーリンク
概要
- 論文の詳細を見る
Fun with Algorithms, 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. ProceedingsRemoving noises in a given binary image is one of common operations. A generalization of the operation is to erase arbitrarily specified component by reversing pixels values in the component. This paper shows that this operation is done without using any data structure like a stack or queue, or without using any extra work space in O(n logn) time for a component consisting of n pixels. This is an in-place algorithm, but the image matrix cannot be used as work space since it has a single bit for each pixel. Whenever we flip pixel value in an objective component, the component shape also changes, which causes some difficulty. An idea for our constant work space algorithm is a conversion keeping its topology.
- 2010-05-29
論文 | ランダム
- OE-020 Genetic Screening and Compound Mutations in Patients with Hypertrophic Cardiomyopathy(OE04,Cardiomyopathy/Hypertrophy (Clinical) (M),Oral Presentation (English),The 73rd Annual Scientific Meeting of The Japanese Circulation Society)
- FRS-090 Identification of a Novel Disease Gene for Hypertrophic Cardiomyopathy(FRS19,Genetic Abnormalities in Cardiac Hypertrophy and Cardiomyopathy (M),Featured Research Session (English),The 73rd Annual Scientific Meeting of The Japanese Circulation Soc
- Dependence of Chemical Shift Difference on Core-Level
- Improvement in prognosis of dilated cardiomyopathy in the elderly over the past 20 years
- Hypertrophic cardiomyopathy with mild left ventricular remodeling : Echocardiographic assessment using left ventricular wall motion score