| 1. |
|
|
| 2. |
|
|
| 3. |
- Van den Bulcke, Jan, et al.
(författare)
-
3D tree-ring analysis using helical X-ray tomography
- 2014
-
Ingår i: Dendrochronologia. - : Elsevier BV. - 1125-7865 .- 1612-0051. ; 32:1, s. 39-46
-
Tidskriftsartikel (refereegranskat)abstract
- The current state-of-the-art of tree-ring analysis and densitometry is still mainly limited to two dimensions and mostly requires proper treatment of the surface of the samples. In this paper we elaborate on the potential of helical X-ray computed tomography for 3D tree-ring analysis. Microdensitometrical profiles are obtained by processing of the reconstructed volumes. Correction of the structure direction, taking into account the angle of growth rings and grain, results in very accurate microdensity and precise ring width measurements. Both a manual as well as an automated methodology is proposed here, of which the MATLAB (c) code is available. Examples are given for pine (Pinus sylvestris L), oak (Quercus robur L) and teak (Tectona grandis L.). In all, the methodologies applied here on the 3D volumes are useful for growth related studies, enabling a fast and non-destructive analysis.
|
|
| 4. |
|
|
| 5. |
- Wernersson, Erik L. G., et al.
(författare)
-
Postprocessing method for reducing phase effects in reconstructed microcomputed-tomography data
- 2013
-
Ingår i: Optical Society of America. Journal A. - 1084-7529 .- 1520-8532. ; 30:3, s. 455-461
-
Tidskriftsartikel (refereegranskat)abstract
- With increased resolution in x-ray computed tomography, refraction adds increasingly to the attenuation signal. Though potentially beneficial, the artifacts caused by refraction often need to be removed from the image. In this paper, we propose a postprocessing method, based on deconvolution, that is able to remove these artifacts after conventional reconstruction. This method poses two advantages over existing projection-based (preprocessing) phase-retrieval or phase-removal algorithms. First, evaluation of the parameters can be done very quickly, improving the overall speed of the method. Second, postprocessing methods can be applied when projection data is not available, which occurs in several commercial systems with closed software or when projection data has been deleted. It is shown that the proposed method performs comparably to state-of-the-art methods in terms of image quality.
|
|
| 6. |
- Asplund, Teo, et al.
(författare)
-
A Faster, Unbiased Path Opening by Upper Skeletonization and Weighted Adjacency Graphs
- 2016
-
Ingår i: IEEE Transactions on Image Processing. - 1057-7149 .- 1941-0042. ; 25:12, s. 5589-5600
-
Tidskriftsartikel (refereegranskat)abstract
- The path opening is a filter that preserves bright regions in the image in which a path of a certain length L fits. A path is a (not necessarily straight) line defined by a specific adjacency relation. The most efficient implementation known scales as O(min(L, d, Q)N) with the length of the path, L, the maximum possible path length, d, the number of graylevels, Q, and the image size, N. An approximation exists (parsimonious path opening) that has an execution time independent of path length. This is achieved by preselecting paths, and applying 1D openings along these paths. However, the preselected paths can miss important structures, as described by its authors. Here, we propose a different approximation, in which we preselect paths using a grayvalue skeleton. The skeleton follows all ridges in the image, meaning that no important line structures will be missed. An H-minima transform simplifies the image to reduce the number of branches in the skeleton. A graph-based version of the traditional path opening operates only on the pixels in the skeleton, yielding speedups up to one order of magnitude, depending on image size and filter parameters. The edges of the graph are weighted in order to minimize bias. Experiments show that the proposed algorithm scales linearly with image size, and that it is often slightly faster for longer paths than for shorter paths. The algorithm also yields the most accurate results- as compared with a number of path opening variants-when measuring length distributions.
|
|
| 7. |
- Asplund, Teo, et al.
(författare)
-
Adaptive Mathematical Morphology on Irregularly Sampled Signals in Two Dimensions
- 2020
-
Ingår i: Mathematical Morphology : Theory and Applications. - : Walter de Gruyter. - 2353-3390. ; 4:1, s. 108-126
-
Tidskriftsartikel (refereegranskat)abstract
- This paper proposes a way of better approximating continuous, two-dimensional morphologyin the discrete domain, by allowing for irregularly sampled input and output signals. We generalizeprevious work to allow for a greater variety of structuring elements, both flat and non-flat. Experimentallywe show improved results over regular, discrete morphology with respect to the approximation ofcontinuous morphology. It is also worth noting that the number of output samples can often be reducedwithout sacrificing the quality of the approximation, since the morphological operators usually generateoutput signals with many plateaus, which, intuitively do not need a large number of samples to be correctlyrepresented. Finally, the paper presents some results showing adaptive morphology on irregularlysampled signals.
|
|
| 8. |
|
|
| 9. |
- Asplund, Teo, et al.
(författare)
-
Mathematical Morphology on Irregularly Sampled Data Applied to Segmentation of 3D Point Clouds of Urban Scenes
- 2019
-
Ingår i: International Symposium on Mathematical Morphology and Its Applications to Signal and Image Processing. - Cham : Springer Nature. - 9783030208660 - 9783030208677
-
Konferensbidrag (refereegranskat)abstract
- This paper proposes an extension of mathematical morphology on irregularly sampled signals to 3D point clouds. The proposed method is applied to the segmentation of urban scenes to show its applicability to the analysis of point cloud data. Applying the proposed operators has the desirable side-effect of homogenizing signals that are sampled heterogeneously. In experiments we show that the proposed segmentation algorithm yields good results on the Paris-rue-Madame database and is robust in terms of sampling density, i.e. yielding similar labelings for more sparse samplings of the same scene.
|
|
| 10. |
- Asplund, Teo, et al.
(författare)
-
Mathematical Morphology on Irregularly Sampled Signals
- 2017
-
Ingår i: Computer Vision – ACCV 2016 Workshops. - Cham : Springer. - 9783319544267 - 9783319544274 ; , s. 506-520
-
Konferensbidrag (refereegranskat)abstract
- This paper introduces a new operator that can be used to ap-proximate continuous-domain mathematical morphology on irregularly sampled surfaces. We define a new way of approximating the continuous domain dilation by duplicating and shifting samples according to a flat continuous structuring element. We show that the proposed algorithm can better approximate continuous dilation, and that dilations may be sampled irregularly to achieve a smaller sampling without greatly com-promising the accuracy of the result.
|
|
