• Journal of applied mathematics & informatics
• /
• 제4권2호
• /
• pp.563-571
• /
• 1997

In this paper we define CR(completely reachable), MICR(minimal cyclic refinement)and MACR(maximal cyclic refinement)-Modules. We have obtained equivalent statements for minimal cyclic submodule and maximal cyclic submodule. Also we have obtained necessary and sufficient conditions for a module M with MICR to be cyclic or strongly cyclic.

• 대한수학회지
• /
• 제35권1호
• /
• pp.1-9
• /
• 1998

In this paper we define CR(completely reachable), MICR(minimal cyclic refinement) and MACR(maximal cyclic refinement)-Modules. We have obtained equivalent statements for minimal cyclic submodule and maximal cyclic submodule. Also, we have obtained necessary and sufficient conditions for a module M with MICR to be cyclic or strongly cyclic.

• 대한임베디드공학회논문지
• /
• 제18권5호
• /
• pp.259-265
• /
• 2023

Pedestrian detection is used to effectively detect pedestrians in various situations based on deep learning. Pedestrian detection has difficulty detecting pedestrians due to problems such as camera performance, pedestrian description, height, and occlusion. Even in the same pedestrian, performance in detecting them can differ according to the height of the pedestrian. The height of general pedestrians encompasses various scales, such as those of infants, adolescents, and adults, so when the model is applied to one group, the extraction of data becomes inaccurate. Therefore, this study proposed a pedestrian detection method that fine-tunes the pedestrian area by Refining Layer and Feature Concatenation to consider various heights of pedestrians. Through this, the score and location value for the pedestrian area were finely adjusted. Experiments on four types of test data demonstrate that the proposed model achieves 2-5% higher average precision (AP) compared to Faster R-CNN and DRPN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권4호
• /
• pp.938-958
• /
• 2024

Unsupervised Video Object Segmentation (UVOS) is a highly challenging problem in computer vision as the annotation of the target object in the testing video is unknown at all. The main difficulty is to effectively handle the complicated and changeable motion state of the target object and the confusion of similar background objects in video sequence. In this paper, we propose a novel deep Dual-stream Co-enhanced Network (DC-Net) for UVOS via bidirectional motion cues refinement and multi-level feature aggregation, which can fully take advantage of motion cues and effectively integrate different level features to produce high-quality segmentation mask. DC-Net is a dual-stream architecture where the two streams are co-enhanced by each other. One is a motion stream with a Motion-cues Refine Module (MRM), which learns from bidirectional optical flow images and produces fine-grained and complete distinctive motion saliency map, and the other is an appearance stream with a Multi-level Feature Aggregation Module (MFAM) and a Context Attention Module (CAM) which are designed to integrate the different level features effectively. Specifically, the motion saliency map obtained by the motion stream is fused with each stage of the decoder in the appearance stream to improve the segmentation, and in turn the segmentation loss in the appearance stream feeds back into the motion stream to enhance the motion refinement. Experimental results on three datasets (Davis2016, VideoSD, SegTrack-v2) demonstrate that DC-Net has achieved comparable results with some state-of-the-art methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권1호
• /
• pp.64-88
• /
• 2024

Security and reliability are the utmost importance facts in intelligent networked vehicles. Stochastic Petri Net and Z (SPZN) as an excellent formal verification tool for modeling concurrent systems, can effectively handles concurrent operations within a system, establishes relationships among components, and conducts verification and reasoning to ensure the system's safety and reliability in practical applications. However, the application of a system with numerous nodes to Petri Net often leads to the issue of state explosion. To tackle these challenges, a refinement and abstraction method based on SPZN is proposed in this paper. This approach can not only refine and abstract the Stochastic Petri Net but also establish a corresponding relationship with the Z language. In determining the implementation rate of transitions in Stochastic Petri Net, we employ the interval average and weighted average method, which significantly reduces the time and space complexity compared to alternative techniques and is suitable for expert systems at various levels. This reduction facilitates subsequent comprehensive system analysis and module analysis. Furthermore, by analyzing the properties of Markov Chain isomorphism in the case study, recommendations for minimizing system risks in the application of intelligent parking within the intelligent networked vehicle system can be put forward.

• International Journal of Internet, Broadcasting and Communication
• /
• 제12권2호
• /
• pp.21-29
• /
• 2020

This paper presents an effective single image haze removal using edge-preserving and adaptive transmission estimation to enhance the visibility of outdoor images vulnerable to weather and environmental conditions with computational complexity reduction. The conventional methods involve the time-consuming refinement process. The proposed transmission estimation however does not require the refinement, since it preserves the edges effectively, which selects one between the pixel-based dark channel and the patch-based dark channel in the vicinity of edges. Moreover, we propose an adaptive transmission estimation to improve the visual quality particularly in bright areas like sky. Experimental results with various hazy images represent that the proposed method is superior to the conventional methods in both subjective visual quality and computational complexity. The proposed method can be adopted to compose a haze removal module for realtime devices such as mobile devices, digital cameras, autonomous vehicles, and so on as well as PCs that have enough processing resources.

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2009년 추계학술대회논문집
• /
• pp.151-158
• /
• 2009

To implement the insects' flapping flight for developing flapping MAVs(micro air vehicles), the unsteady flow characteristics of the insects' forward flight is investigated. In this paper, two-dimensional FSI(Fluid-Structure Interaction) simulations are conducted to examine realistic flow features of insects' flapping flight and to examine the flexibility effects of the insect's wing. The unsteady incompressible Navier-Stokes equations with an artificial compressibility method are implemented as the fluid module while the dynamic finite element equations using a direct integration method are employed as the solid module. In order to exchange physical information to each module, the common refinement method is employed as the data transfer method. Also, a simple and efficient dynamic grid deformation technique based on Delaunay graph mapping is used to deform computational grids. Compared to the earlier researches of two-dimensional rigid wing simulations, key physical phenomena and flow patterns such as vortex pairing and vortex staying can still be observed. For example, lift is mainly generated during downstroke motion by high effective angle of attack caused by translation and lagging motion. A large amount of thrust is generated abruptly at the end of upstroke motion. However, the quantitative aspect of flow field is somewhat different. A flexible wing generates more thrust but less lift than a rigid wing. This is because the net force acting on wing surface is split into two directions due to structural flexibility. As a consequence, thrust and propulsive efficiency was enhanced considerably compared to a rigid wing. From these numerical simulations, it is seen that the wing flexibility yields a significant impact on aerodynamic characteristics.

• 한국지진공학회논문집
• /
• 제27권2호
• /
• pp.77-82
• /
• 2023

The structural analysis module is an essential part of any integrated structural system. Diverse integrated systems today require, from the analysis module, efficient real-time responses to real-time input such as earthquake signals, extreme weather-related forces, and man-made accidents. An integrated system may also be for the entire life span of a civil structure conceived during the initial conception, developed throughout various design stages, effectively used in construction, and utilized during usage and maintenance. All these integrated systems' essential part is the structural analysis module, which must be automated and computationally efficient so that responses may be almost immediate. The finite element method is often used for structural analysis, and for automation, many effective finite element meshes must be automatically generated for a given analysis. A computationally efficient finite element mesh generation scheme based on the r-h method of mesh refinement using strain deviations from the values at the Gauss points as error estimates from the previous mesh is described. Shape factors are used to sort out overly distorted elements. A standard cantilever beam analyzed by four-node plane stress elements is used as an example to show the effectiveness of the automated algorithm for a time-domain dynamic analysis. Although recent developments in computer hardware and software have made many new applications in integrated structural systems possible, structural analysis still needs to be executed efficiently in real-time. The algorithm applies to diverse integrated systems, including nonlinear analyses and general dynamic problems in earthquake engineering.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.264-267
• /
• 2003

Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However dynamic programming cannot be applied to certain cost function due its drawback and to produce optimal multiple sequence alignment. We proposed sub-alignment refinement algorithm to overcome the problem of dynamic programming and impelmented this algorithm as a module of our MS Windows-based sequence alignment program.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2000년도 가을 학술발표논문집 Vol.27 No.2 (2)
• /
• pp.209-211
• /
• 2000

SPIHT(Set Partitioning In Hierarchical Trees) 부호화 알고리즘은 EXW(Embedded Zerotree Wavelet) 부호와 알고리즘의 부호화 방법을 개선하여 압축 효율을 개선한 알고리즘이다. SPIHT 부호화 알고리즘은 웨이브렛 변환된 영상의 계수 값이 동일한 방향은 갖는 대역 사이에서 상관 관계를 갖는다는 점을 이용한다는 점에서 EZW 부호화 알고리즘과 동일하다. 그러나 zerotree의 부호화 부분에서 계수의 중요도에 따라 부분 집합으로 분할해 가는 과정과 분할된 계수들을 부호화하는 과정을 개선하였다. 이 부호화 과정에서의 significant map은 모든 threshold에 대해서 LSP(List of Insignificant Pixels), LIP(List of Insignificant), LIS(List of Insignificant Sets)의 세가지 리스트를 통하여 구하여 진다. 그리고, 전체 알고리즘은 초기화, Sorting pass, Refinement pass, 양자화 값 갱신의 네 가지 단계로 구성된다. 본 논문에서는 SPIHT 구현에 필요한 자료구조를 제안하고 SPIHT 부호화 모듈을 구현에 대하여 설명한다.