• Journal of Korean Society of Forest Science
• /
• v.89 no.3
• /
• pp.397-404
• /
• 2000

This study was carried out to investigate the influence of the road structure and site conditions on side-ditch stability of forest road. For experimental purposes, the forest road in the Kwangrung Experimental Forest, Korea Forestry Research Institute, was chosen as a study site. A total of 556 plots wes set up as every longitudinal gradient changing points by belt-transect method. Data of 10 road structural characteristics and side-ditch stability were collected from each plot and analysed by Quantification II. The main factors in order of partial correlation coefficient were longitudinal gradient, road position, inclination of cut-slope, constituent material of cut-slopes, distance of surface flow, cross-sectional shape of road, pavement material, vegetation of cut-slopes and length of cut-slope. The erosion of side-ditch of forest road occurred in the following cases; more than 8% of the longitudinal gradient, road position of hill under side and foot hill, more than $50^{\circ}$ of inclination of cut-slope, constituent material of cut-slopes of hard soil and gravel soil, more than 80m of distance of surface flow, pavement material with earth or gravel, more than medium covered of vegetation of cut-slopes, and the straight and convex form of road-bed.

• Investigative Magnetic Resonance Imaging
• /
• v.13 no.1
• /
• pp.22-30
• /
• 2009

Purpose : Patient motion during magnetic resonance (MR) imaging is one of the major problems due to its long scan time. Entropy based post-processing motion correction techniques have been shown to correct motion artifact effectively. One of main limitations of these techniques however is its long processing time. In this study, we propose several methods to reduce this long processing time effectively. Materials and Methods : To reduce the long processing time, we used the separability property of two dimensional Fourier transform (2-D FT). Also, a computationally light metric (sum of all image pixel intensity) was used instead of the entropy criterion. Finally, partial Fourier reconstruction, in particular the projection onto convex set (POCS) method, was combined thereby reducing the size of the data which should be processed and corrected. Results : Time savings of each proposed method are presented with different data size of brain images. In vivo data were processed using the proposed method and showed similar image quality. The total processing time was reduced to 15% in two dimensional images and 30% in the three dimensional images. Conclusion : The proposed methods can be useful in reducing image motion artifacts when only post-processing motion correction algorithms are available. The proposed methods can also be combined with parallel imaging technique to further reduce the processing times.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.9
• /
• pp.479-490
• /
• 2001

In this paper, we consider the method of partitioning a sphere into faces with a set of spherical convex polygons $\Gamma$=$｛P_1...P_n｝$ for determining the maximum of minimum intersection. This problem is commonly related with five geometric problems that fin the densest hemisphere containing the maximum subset of $\Gamma$, a great circle separating $\Gamma$, a great circle bisecting $\Gamma$ and a great circle intersecting the minimum or maximum subset of $\Gamma$. In order to efficiently compute the minimum or maximum intersection of spherical polygons. we take the approach of edge-based partition, in which the ownerships of edges rather than faces are manipulated as the sphere is incrementally partitioned by each of the polygons. Finally, by gathering the unordered split edges with the maximum number of ownerships. we approximately obtain the centroids of the solution faces without constructing their boundaries. Our algorithm for finding the maximum intersection is analyzed to have an efficient time complexity O(nv) where n and v respectively, are the numbers of polygons and all vertices. Furthermore, it is practical from the view of implementation, since it computes numerical values. robustly and deals with all the degenerate cases, Using the similar approach, the boundary of a general intersection can be constructed in O(nv+LlogL) time, where : is the output-senstive number of solution edges.