• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.3
• /
• pp.384-389
• /
• 2003

A new two-step soft-output Viterbi algorithm (SOVA) decoder architecture is presented. A significant reduction in the decoding latency can be achieved through the use of the dual-port RAM in the survivor memory structure of the trace-back unit. The system complexity can be lowered due to the determination of the absolute value of the path metric differences inside the add-compare-select (ACS) unit. The proposed SOVA architecture was verified successfully by the functional simulation of Verilog HDL modeling and the FPGA prototyping. The SOVA decoder achieves a data rate very close to that of the conventional Viterbi Algorithm (VA) decoder and the resource consumption of the realized SOVA decoder is only one and a half times larger than that of the conventional VA decoder.

• ALGAE
• /
• v.31 no.1
• /
• pp.1-16
• /
• 2016

Paralia species have been frequently reported as P. sulcata in Korea, despite the species diversity within the genus. To understand the species diversity of Paralia in Korea, we collected phytoplankton samples at 79 sites from April 2006 to April 2015. Five Paralia species, P. fenestrata, P. guyana, P. marina, P. cf. obscura, and P. sulcata, were observed during this study, and we described their fine structure in terms of quantitative and qualitative morphological characteristics. To provide additional criteria to identify Paralia species more clearly, we morphometrically analysed four quantitative characteristics on valve diameter: pervalvar axis / diameter, internal linking spines / diameter, marginal linking spines / diameter, and fenestrae/diameter using non-metric multidimensional scaling (MDS). MDS analysis distinguished four Paralia species: P. guyana, P. marina, P. cf. obscura, and P. sulcata, with the exception of P. fenestrata. This new approach in using morphometric analysis is useful for the accurate identification of Paralia species.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.129-131
• /
• 2010

This study is to measure 3d deformation of railroad-bridge of steel structure using the non-metric high-resolution digital camera. Measuring the deformation is to be utilized relative orientation using the coplanarity for reduction of the field survey and efficiency of the work. The results are compared with deformation by exterior orientation parameters, which are computed from 3d measurement of control points by the Total-station. Then accuracy of the utilized method will be verified.

• Structural Monitoring and Maintenance
• /
• v.9 no.3
• /
• pp.289-303
• /
• 2022

In this study, the impact of assigned pixel labels on the accuracy of crack image identification of steel structures is examined by using an atrous separable convolution neural network (ASCNN). Firstly, images containing fatigue cracks collected from steel structures are classified into four datasets by assigning different pixel labels based on image features. Secondly, the DeepLab v3+ algorithm is used to determine optimal parameters of the ASCNN model by maximizing the average mean-intersection-over-union (mIoU) metric of the datasets. Thirdly, the ASCNN model is trained for various image sizes and hyper-parameters, such as the learning rule, learning rate, and epoch. The optimal parameters of the ASCNN model are determined based on the average mIoU metric. Finally, the trained ASCNN model is evaluated by using 10% untrained images. The result shows that the ASCNN model can segment cracks and other objects in the captured images with an average mIoU of 0.716.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.881-895
• /
• 2023

Modern image inpainting techniques based on deep learning have achieved remarkable performance, and more and more people are working on repairing more complex and larger missing areas, although this is still challenging, especially for facial image inpainting. For a face image with a huge missing area, there are very few valid pixels available; however, people have an ability to imagine the complete picture in their mind according to their subjective will. It is important to simulate this capability while maintaining the identity features of the face as much as possible. To achieve this goal, we propose a three-stage network model, which we refer to as the identity and structure feature refinement network (ISFRNet). ISFRNet is based on 1) a pre-trained pSp-styleGAN model that generates an extremely realistic face image with rich structural features; 2) a shallow structured network with a small receptive field; and 3) a modified U-net with two encoders and a decoder, which has a large receptive field. We choose structural similarity index (SSIM), peak signal-to-noise ratio (PSNR), L1 Loss and learned perceptual image patch similarity (LPIPS) to evaluate our model. When the missing region is 20%-40%, the above four metric scores of our model are 28.12, 0.942, 0.015 and 0.090, respectively. When the lost area is between 40% and 60%, the metric scores are 23.31, 0.840, 0.053 and 0.177, respectively. Our inpainting network not only guarantees excellent face identity feature recovery but also exhibits state-of-the-art performance compared to other multi-stage refinement models.

• Honam Mathematical Journal
• /
• v.33 no.4
• /
• pp.557-573
• /
• 2011

Let G be a compact and connected semisimple Lie group, H a closed subgroup, g (resp. h) the Lie algebra of G (resp. H), B the Killing form of g, g the normal metric on the homogeneous space G/H which is induced by -B. Let D be an invarint connection with Weyl structure (D, g, ${\omega}$) in the tangent bundle over the normal homogeneous Riemannian manifold (G/H, g) which is projectively flat. Then, the affine connection D on (G/H, g) is a Yang-Mills connection if and only if D is the Levi-Civita connection on (G/H, g).

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.433-448
• /
• 1998

In this study we use inexact Newton-like methods to find solutions of nonlinear operator equations on Banach spaces with a convergence structure. Our technique involves the introduction of a generalized norm as an operator from a linear space into a par-tially ordered Banach space. In this way the metric properties of the examined problem can be analyzed more precisely. Moreover this approach allows us to derive from the same theorem on the one hand semi-local results of kantorovich-type and on the other hand 2global results based on monotonicity considerations. By imposing very general Lipschitz-like conditions on the operators involved on the other hand by choosing our operators appropriately we can find sharper error bounds on the distances involved than before. Furthermore we show that special cases of our results reduce to the corresponding ones already in the literature. Finally our results are used to solve integral equations that cannot be solved with existing methods.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.129-140
• /
• 2011

The aim of this paper is to study the structure of the fundamental group of a closed oriented Riemannian manifold with positive scalar curvature. To be more precise, let M be a closed oriented Riemannian manifold of dimension n (4 $\leq$ n $\leq$ 7) with positive scalar curvature and non-trivial first Betti number, and let be $\alpha$ non-trivial codimension one homology class in $H_{n-1}$(M;$\mathbb{R}$). Then it is known as in [8] that there exists a closed embedded hypersurface $N_{\alpha}$ of M representing $\alpha$ of minimum volume, compared with all other closed hypersurfaces in the homology class. Our main result is to show that the fundamental group ${\pi}_1(N_{\alpha})$ is always virtually free. In particular, this gives rise to a new obstruction to the existence of a metric of positive scalar curvature.

• Journal of Korean Society for Quality Management
• /
• v.33 no.2
• /
• pp.1-12
• /
• 2005

An extensive literature review has been made in this paper to build the evaluation hierarchy structure for the certification of electronic commerce services. In building the evaluation hierarchy structure, major candidate evaluation factors are selected by bench marking the various certification practices, including the Malcolm Baldrige award, ISO9000, and BSC(balanced scorecard) techniques. This paper deployed principal component analysis and factor analysis techniques to develop a statistically solid and systematic evaluation model. The final evaluation model, as presented in this paper as a model for the certification of electronic commerce services, produces a numeric score on the 100% scale, which can be served as a metric for the certification decision. The AHP technique was used in converting the various qualitative and quantitative evaluation values into a single measure for the certification decision.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.780-787
• /
• 2005

Many researches and validations for the complexity metrics of the object-oriented systems have been studied. Most of them are aimed for the measurement of the partial aspects of the systems, for example, the coupling between objects, the complexity of inheritance structures, the cohesion of methods, and so on. But the software practitioners want to measure the complexity of overall system, not partial. We studied the complexity of the overall structures of object-oriented systems by analyzing the class diagram of UML. The class diagram is composed of classes and their relations. There are three kinds of relations, association, generalization, and aggregation, which are making the structure of object-oriented systems to be difficult to understand. We proposed a heuristic metric to measure the complexity of object-oriented systems by putting together the three kinds of the relations. Tn analyze the complexity of the structure of a object-oriented system for the maintainability of the system, we measured the degree of understandability of it, the reverse engineering time to draw a class diagram from the source codes, and the number of errors in the diagram. The results of this experiment shows that our proposed metric has a considerable relationship with the complexity of object-oriented systems. The metric will be helpful to the software developers for their designing tasks by evaluating the complexity of the structures of object-oriented systems and redesigning tasks , of them for the future maintainability.