| 1. |
|
|
| 2. |
|
|
| 3. |
- Curic, Vladimir, et al.
(författare)
-
Salience adaptive structuring elements
- 2012
-
Ingår i: IEEE Journal on Selected Topics in Signal Processing. - 1932-4553 .- 1941-0484. ; 6:7, s. 809-819
-
Tidskriftsartikel (refereegranskat)abstract
- Spatially adaptive structuring elements adjust their shape to the local structures in the image, and are often defined by a ball in a geodesic distance or gray-weighted distance metric space. This paper introduces salience adaptive structuring elements as spatially variant structuring elements that modify not only their shape, but also their size according to the salience of the edges in the image. Morphological operators with salience adaptive structuring elements shift edges with high salience to a less extent than those with low salience. Salience adaptive structuring elements are less flexible than morphological amoebas and their shape is less affected by noise in the image. Consequently, morphological operators using salience adaptive structuring elements have better properties.
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
- Fakhrzadeh, Azadeh, et al.
(författare)
-
Epithelial Cell Segmentation in Histological Images of Testicular Tissue Using Graph-Cut
- 2013
-
Ingår i: Image Analysis and Processing – ICIAP 2013. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 9783642411830 - 9783642411847 ; 8157, s. 201-208
-
Konferensbidrag (refereegranskat)abstract
- Computerized image processing has provided us with valuable tools for analyzing histology images. However, histology images are complex, and the algorithm which is developed for a data set may not work for a new and unseen data set. The preparation procedure of the tissue before imaging can significantly affect the resulting image. Even for the same staining method, factors like delayed fixation may alter the image quality. In this paper we face the challenging problem of designing a method that works on data sets with strongly varying quality. In environmental research, due to the distance between the site where the wild animals are caught and the laboratory, there is always a delay in fixation. Here we suggest a segmentation method based on the structural information of epithelium cell layer in testicular tissue. The cell nuclei are detected using the fast radial symmetry filter. A graph is constructed on top of the epithelial cells. Graph-cut optimization method is used to cut the links between cells of different tubules. The algorithm is tested on five different groups of animals. Group one is fixed immediately, three groups were left at room temperature for 18, 30 and 42 hours respectively, before fixation. Group five was frozen after 6 hours in room temperature and thawed. The suggested algorithm gives promising results for the whole data set.
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
- Luengo Hendriks, Cris L., 1974-
(författare)
-
Revisiting priority queues for image analysis
- 2010
-
Ingår i: Pattern Recognition. - : Elsevier BV. - 0031-3203 .- 1873-5142. ; 43:9, s. 3003-3012
-
Tidskriftsartikel (refereegranskat)abstract
- Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queue with the highest priority. However, very few articles describing such image analysis algorithms specify which implementation of the priority queue was used. Many assessments of priority queues can be found in the literature, but mostly in the context of numerical simulation rather than image analysis. Furthermore, due to the ever-changing characteristics of computing hardware, performance evaluated empirically 10 years ago is no longer relevant. In this paper I revisit priority queues as used in image analysis routines, evaluate their performance in a very general setting, and come to a very different conclusion than other authors: implicit heaps are the most efficient priority queues. At the same time. I propose a simple modification of the hierarchical queue (or bucket queue) that is more efficient than the implicit heap for extremely large queues.
|
|
| 10. |
|
|
