• Title/Summary/Keyword: Edges

Search Result 2,652, Processing Time 0.026 seconds

A NOVEL DISCUSSION ON POWER FUZZY GRAPHS AND THEIR APPLICATION IN DECISION MAKING

  • T. BHARATHI;S. SHINY PAULIN;BIJAN DAVVAZ
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.1
    • /
    • pp.123-137
    • /
    • 2024
  • In this paper, Power fuzzy graphs is newly introduced by allotting fuzzy values on power graphs in such a way that the newly added edges, has the edge membership values between a closed interval which depends on vertex membership values and the length of the added edges. Power fuzzy subgraphs and total power fuzzy graphs are newly defined with properties and some special cases. It is observed that every power fuzzy graph is a fuzzy graph but the converse need not be true. Edges that are incident to vertices with the least vertex membership values are retained in the least power fuzzy subgraph. Further, the application of these concepts in real life time has been presented and discussed using power fuzzy graph model.

Object Detection Algorithm Using Edge Information on the Sea Environment (해양 환경에서 에지 정보를 이용한 물표 추출 알고리즘)

  • Jeong, Jong-Myeon;Park, Gyei-Kark
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.9
    • /
    • pp.69-76
    • /
    • 2011
  • According to the related reports, about 60 percents of ship collisions have resulted from operating mistake caused by human factor. Specially, the report said that negligence of observation caused 66.8 percents of the accidents due to a human factor. Hence automatic detection and tracking of an object from an IR images are crucial for safety navigation because it can relieve officer's burden and remedies imperfections of human visual system. In this paper, we present a method to detect an object such as ship, rock and buoy from a sea IR image. Most edge directions of the sea image are horizontal and most vertical edges come out from the object areas. The presented method uses them as a characteristic for the object detection. Vertical edges are extracted from the input image and isolated edges are eliminated. Then morphological closing operation is performed on the vertical edges. This caused vertical edges that actually compose an object be connected and become an object candidate region. Next, reference object regions are extracted using horizontal edges, which appear on the boundaries between surface of the sea and the objects. Finally, object regions are acquired by sequentially integrating reference region and object candidate regions.

Edge Compensation Algorithm by Extracting the Skeletons from the Uplifted Image (융기된 영상의 골격선 추출에 의한 에지 보정 알고리듬)

  • 박미진;양영일
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.167-170
    • /
    • 2000
  • In this paper, we propose the edge compensation algorithm which connects the adjacent edges without losing the information of the skeletons on the edge image. The proposed edge compensation algorithm is composed of succeeding two steps. In the first step, the uplifted image is obtained by applying the uplifting process to the edge image. The next step is to extract the edge image from the uplifted image using the skeleton extraction algorithm. Experimental results show that the proposed method connects the adjacent edges without the distortion of the original edge information compared to the traditional method

  • PDF

Buckling and vibration of symmetric laminated composite plates with edges elastically restrained

  • Ashour, Ahmed S.
    • Steel and Composite Structures
    • /
    • v.3 no.6
    • /
    • pp.439-450
    • /
    • 2003
  • The finite strip transition matrix technique, a semi analytical method, is employed to obtain the buckling loads and the natural frequencies of symmetric cross-ply laminated composite plates with edges elastically restrained against both translation and rotation. To illustrate the accuracy and the validation of the method several example of cross play laminated composite plates were analyzed. The buckling loads and the frequency parameters are presented and compared with available results in the literature. The convergence study and the excellent agreement with known results show the reliability of the purposed technique.

분리형 삼각형을 기준으로한 입체모델링에 관한 연구

  • 정인성;채희창
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2001.10a
    • /
    • pp.244-248
    • /
    • 2001
  • A solid modeller was developed in this paper. Representation scheme of modelling is nonmanifold B-rep. While many B-rep modelers use edges as basic element of modelling, this modeller is triangle-based. New modelling element, split triangle that is composed of 3 pure half-edges and has no information about the adjoining triangles, was defined to enlarge the range of representation. Corresponding algorithms for Boolean set operations were also developed.

Bayesian Image Reconstruction Using Edge Detecting Process for PET

  • Um, Jong-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.12
    • /
    • pp.1565-1571
    • /
    • 2005
  • Images reconstructed with Maximum-Likelihood Expectation-Maximization (MLEM) algorithm have been observed to have checkerboard effects and have noise artifacts near edges as iterations proceed. To compensate this ill-posed nature, numerous penalized maximum-likelihood methods have been proposed. We suggest a simple algorithm of applying edge detecting process to the MLEM and Bayesian Expectation-Maximization (BEM) to reduce the noise artifacts near edges and remove checkerboard effects. We have shown by simulation that this algorithm removes checkerboard effects and improves the clarity of the reconstructed image and has good properties based on root mean square error (RMS).

  • PDF

ON CONSTRUCTIONS OF NEW SUPER EDGE-MAGIC GRAPHS FROM SOME OLD ONES BY ATTACHING SOME PENDANTS

  • Kim, Young-Hun
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.1
    • /
    • pp.225-231
    • /
    • 2017
  • Baskoro et al. [1] provided some constructions of new super edge-magic graphs from some old ones by attaching 1, 2, or 3 pendant vertices and edges. In this paper, we introduce (q, m)-super edge-magic total labeling and we give a construction of new super edge-magic graphs by attaching n pendant vertices and edges under some conditions, for any positive integer n. Also, we give a constraint on our construction.

Real-Time Automatic Target Tracking Using a Centroid of Moving Edges (이동경계의 무게중심에 의한 실시간 자동목표 추적)

  • 배정효;김남철
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1987.04a
    • /
    • pp.42-45
    • /
    • 1987
  • In this paper a target tracking algorithm of the centroid extraction from moving edges is proposed, It aims to avoid the difficulty of imahe segmentation in case of the centroid extraction from one frame. The performance of the proposed algorithmfor noisy and occluded images is discussed Finally it is also applied to a real time target tracker.

  • PDF

Buckling of an elastic plate due to surface-attached thin films with intrinsic stresses

  • Zhu, J.;Yang, J.S.;Ru, C.Q.
    • Structural Engineering and Mechanics
    • /
    • v.52 no.1
    • /
    • pp.89-95
    • /
    • 2014
  • We analyze the buckling of a thin elastic plate due to intrinsic stresses in thin films attached to the surfaces of the plate. In the case of cylindrical buckling, it is shown that for a plate with clamped edges compressive intrinsic film stresses can cause flexural buckling of the plate, while tensile intrinsic film stresses cannot. For a plate with free edges, film intrinsic stresses, compressive or tensile, cannot cause buckling.

Test sequence generation using MUIO and shortest paths (MUIO와 shortest path를 이용한 개선된 시험순서생성)

  • 정윤희;홍범기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.5
    • /
    • pp.1193-1199
    • /
    • 1996
  • This paper introduces an algorithm which uses MUIO and the shortest paths to minimize the length of test sequence. The length of test sequence is equal to the total number of the edges in a symmetric test graph $G^{*}$. Therefore, it is important to make a $G^{*}$ with the least number of the edges. This algorithm is based on the one proposed Shen[2]. It needs the complexity to make shortest paths but reduces the thest sequence by 1.0~9.8% over the Shen's algorithm. and this technique, directly, derives a symmetric test graph from an FMS.

  • PDF