• Title/Summary/Keyword: edge class

Search Result 176, Processing Time 0.025 seconds

An Establishment of Canard-Leading Edge Flap Scheduling Law Based on Experimental and Numerical Studies For the Aerodynamic Design of Canard Type Fighter Class Aircraft (카나드 형상 전투기급 항공기 공력설계를 위한 실험 및 수치해석적 카나드-앞전플랩 스케줄링 법칙 수립)

  • Chung, In-Jae;Kim, Sang-Jin
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.7
    • /
    • pp.655-660
    • /
    • 2007
  • A canard-leading edge flap deflection scheduling laws have been established to enhance the maneuverability of the canard type fighter class aircraft. These scheduling laws are the relation of canard-leading edge flap deflections and flight conditions to maximize the lift-drag ratio. For these purposes, the corrected supersonic panel method has been used to predict the lift-drag characteristics due to canard-leading edge flap deflections. In addition, the high speed wind tunnel test has been conducted with 1/20 scale model to validate the predicted scheduling laws. Good agreements have been obtained compared with the results of high speed wind tunnel test. Based on the results obtained from the experimental and numerical studies, the corrected supersonic panel method has shown to be useful to establish the canard-leading edge flap deflection scheduling law for the aerodynamic design of canard type fighter class aircraft.

Edge Class Design for the Development of Edge-based Image Analysis Algorithm (표준화된 Edge기반 영상분석 알고리즘 개발을 위한 윤곽선 클래스 설계 및 구현)

  • 안기옥;황혜정;채옥삼
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.589-591
    • /
    • 2003
  • 영상에 추출된 윤곽선(Edge)은 물체의 핵심적인 형태정보를 포함하고 있어서 영상인식과 분석의 근간이 되고 있다. 따라서 정확한 윤곽선 검출을 위한 많은 연구가 진행되고 있으며 그 응용분야도 다양하다. 그러나 정작 추출된 윤곽선 정보를 효율적으로 표현하고 활용하기 위한 표준화된 자료구조에 대한 연구는 많지 않아서 연구결과의 공유를 어렵게 하고 있다. 본 논문에서는 검출된 윤곽선을 효율적으로 표현, 관리, 검색, 조작하기 위한 자료클래스를 설계구현 함으로서 윤곽선검출 알고리즘의 표준화와 재사용을 촉진시키고 검출된 다양한 응용을 가능하게 한다.

  • PDF

Fusion Matching According to Land Cover Property of High Resolution Images (고해상도 위성영상의 토지피복 특성에 따른 혼합정합)

  • Lee, Hyoseong;Park, Byunguk;Ahn, Kiweon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.6_1
    • /
    • pp.583-590
    • /
    • 2012
  • This study proposes fusion image matching method according to land cover property to generate a detailed DEM using the high resolution IKONOS-2 stereo pair. A classified image, consists of building, crop-land, forest, road and shadow-water, is produced by color image with four bands. Edges and points are also extracted from panchromatic image. Matching is performed by the cross-correlation computing after five classes are automatically selected in a reference image. In each of building class, crop-land class, forest class and road class, matching was performed by the grid and edge, only grid, only grid, grid and point, respectively. Shadow-water class was excepted in the matching because this area causes excessive error of the DEM. As the results, edge line, building and residential area could be expressed more dense than DEM by the conventional method.

Network Intrusion Detection Using Transformer and BiGRU-DNN in Edge Computing

  • Huijuan Sun
    • Journal of Information Processing Systems
    • /
    • v.20 no.4
    • /
    • pp.458-476
    • /
    • 2024
  • To address the issue of class imbalance in network traffic data, which affects the network intrusion detection performance, a combined framework using transformers is proposed. First, Tomek Links, SMOTE, and WGAN are used to preprocess the data to solve the class-imbalance problem. Second, the transformer is used to encode traffic data to extract the correlation between network traffic. Finally, a hybrid deep learning network model combining a bidirectional gated current unit and deep neural network is proposed, which is used to extract long-dependence features. A DNN is used to extract deep level features, and softmax is used to complete classification. Experiments were conducted on the NSLKDD, UNSWNB15, and CICIDS2017 datasets, and the detection accuracy rates of the proposed model were 99.72%, 84.86%, and 99.89% on three datasets, respectively. Compared with other relatively new deep-learning network models, it effectively improved the intrusion detection performance, thereby improving the communication security of network data.

Theory and Experiment of the Cylindrical Edge-Slot Antenna with Coaxial Line Feed (동축선로로 급전된 원통형 에지-슬롯 안테나의 이론 및 실험)

  • 유상기;홍재표;조영기
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.2
    • /
    • pp.39-44
    • /
    • 1994
  • A theoretical method has been considered for the analysis of a cylindrical edge-slot antenna which belongs to a class of circumferential slot antennas that are suitable for conformal mounting on conducting bodies of revolution. A coupled integral equation is formulated for unknown magnetic currents of both the coaxial aperture and the edge slot, and solved by the moment method. Theoretical values for reflection coefficient obtained based upon the method are compared with our experimental values and other author's results available. There arre good agreement between them.

  • PDF

Edge Detection Using Simulated Annealing Algorithm (Simulated Annealing 알고리즘을 이용한 에지추출)

  • Park, J.S.;Kim, S.G.
    • Journal of Power System Engineering
    • /
    • v.2 no.3
    • /
    • pp.60-67
    • /
    • 1998
  • Edge detection is the first step and very important step in image analysis. We cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for comparing the performances of different detectors. This cost function is made of desirable characteristics of edges such as thickness, continuity, length, region dissimilarity. And we use a simulated annealing algorithm for minimum of cost function. Simulated annealing are a class of adaptive search techniques that have been intensively studied in recent years. We present five strategies for generating candidate states. Experimental results(building image and test image) which verify the usefulness of our simulated annealing approach to edge detection are better than other operator.

  • PDF

Interband Vector Quantization of Remotely Sensed Satellite Image Using Edge Region Compensation (에지 영역 보상을 이용한 원격 센싱된 인공위성 화상의 대역간 벡터양자화)

  • Ban, Seong-Won;Kim, Young-Choon;Lee, Kuhn-Il
    • Journal of Sensor Science and Technology
    • /
    • v.8 no.2
    • /
    • pp.124-132
    • /
    • 1999
  • In this paper, we propose interband vector quantization of remotely sensed satellite image using edge region compensation. This method classifies each pixel vector considering spectral reflection characteristics of satellite image data. For each class, we perform classified intraband VQ and classified interband VQ to remove intraband and interband redundancies, respectively. In edge region case, edge region is compensated using class information of neighboring blocks and gray value of quantized reference band. Then we perform classified interband VQ to remove interband, redundancy using compensated class information, effectively. Experiments on remotely sensed satellite image show that coding efficiency of the proposed method is better than that of the conventional method.

  • PDF

A Polynomial Time Algorithm for Edge Coloring Problem (간선 색칠 문제의 다항시간 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.11
    • /
    • pp.159-165
    • /
    • 2013
  • This paper proposes a O(E) polynomial-time algorithm that has been devised to simultaneously solve edge-coloring problem and graph classification problem both of which remain NP-complete. The proposed algorithm selects an edge connecting maximum and minimum degree vertices so as to determine the number of edge coloring ${\chi}^{\prime}(G)$. Determined ${\chi}^{\prime}(G)$ is in turn either ${\Delta}(G)$ or ${\Delta}(G)+1$. Eventually, the result could be classified as class 1 if ${\chi}^{\prime}(G)={\Delta}(G)$ and as category 2 if ${\chi}^{\prime}(G)={\Delta}(G)+1$. This paper also proves Vizing's planar graph conjecture, which states that 'all simple, planar graphs with maximum degree six or seven are of class one, closing the remaining possible case', which has known to be NP-complete.

Early Treatment of Class III Malocclusion (3급 부정교합의 초기치료)

  • Kim, Kaa-Yeong;Kim, Jin-Yeong;Kim, Byeong-Seop
    • Journal of the Korean Academy of Esthetic Dentistry
    • /
    • v.10 no.1
    • /
    • pp.8-15
    • /
    • 2001
  • The Class III malocclusion classified in two types of Skeletal Class III and Pseudo Class III. In the case of the maxillary deficiency, the protraction H-G(facemask) with Bonded RPE can be used. For children with A-P and vertical maxillary deficiency, the preferred treatment is to move the maxilla into a more anterior and inferior position, which also increases its size as bone is added at the posterior and superior sutures. Successful forward repositioning of the maxilla can be accomplished before age 8. To resist tooth movement as much as possible, the maxillary teeth should be splinted together as a single unit. The maxillary appliance must have hooks for attachment to the facemask that are located in the canine-primary molar area above the occlusal plane. The facemask usually worn until a positive overjet of 2-5mm is achieved interincisally. Occipital chin cup is successful in those patients who can bring their incisors close to an edge-to-edge position when in centric relation. This treatment is particularly useful in patients who begin treatment with a short lower anterior facial height, as this type of treatment can lead to an increase in lower anterior facial height. If the pull of the chin cup is directed below the condyle, the force of the appliance may lead to a downward and backward rotation of the mandible.

  • PDF

Edge-Maximal 𝜃k+1-Edge Disjoint Free Graphs

  • Jaradat, Mohammed M.M.;Bataineh, Mohammed S.A.
    • Kyungpook Mathematical Journal
    • /
    • v.54 no.1
    • /
    • pp.23-30
    • /
    • 2014
  • For two positive integers r and s, $\mathcal{G}$(n; r; ${\theta}_s$) denotes to the class of graphs on n vertices containing no r of edge disjoint ${\theta}_s$-graphs and f(n; r; ${\theta}_s$) = max{${\varepsilon}(G)$ : G ${\in}$ $\mathcal{G}$(n; r; ${\theta}_s$)}. In this paper, for integers r, $k{\geq}2$, we determine f(n; r; ${\theta}_{2k+1}$) and characterize the edge maximal members in G(n; r; ${\theta}_{2k+1}$).