• Title/Summary/Keyword: edge class

Search Result 176, Processing Time 0.029 seconds

A Relationship between the Second Largest Eigenvalue and Local Valency of an Edge-regular Graph

  • Park, Jongyook
    • Kyungpook Mathematical Journal
    • /
    • v.61 no.3
    • /
    • pp.671-677
    • /
    • 2021
  • For a distance-regular graph with valency k, second largest eigenvalue r and diameter D, it is known that r ≥ $min\{\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2},\;a_3\}$ if D = 3 and r ≥ $\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2}$ if D ≥ 4, where λ = a1. This result can be generalized to the class of edge-regular graphs. For an edge-regular graph with parameters (v, k, λ) and diameter D ≥ 4, we compare $\frac{{\lambda}+\sqrt{{\lambda}^2+4k}}{2}$ with the local valency λ to find a relationship between the second largest eigenvalue and the local valency. For an edge-regular graph with diameter 3, we look at the number $\frac{{\lambda}-\bar{\mu}+\sqrt{({\lambda}-\bar{\mu})^2+4(k-\bar{\mu})}}{2}$, where $\bar{\mu}=\frac{k(k-1-{\lambda})}{v-k-1}$, and compare this number with the local valency λ to give a relationship between the second largest eigenvalue and the local valency. Also, we apply these relationships to distance-regular graphs.

Medical Image Retrieval based on Multi-class SVM and Correlated Categories Vector

  • Park, Ki-Hee;Ko, Byoung-Chul;Nam, Jae-Yeal
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.8C
    • /
    • pp.772-781
    • /
    • 2009
  • This paper proposes a novel algorithm for the efficient classification and retrieval of medical images. After color and edge features are extracted from medical images, these two feature vectors are then applied to a multi-class Support Vector Machine, to give membership vectors. Thereafter, the two membership vectors are combined into an ensemble feature vector. Also, to reduce the search time, Correlated Categories Vector is proposed for similarity matching. The experimental results show that the proposed system improves the retrieval performance when compared to other methods.

A STUDY OF TYPES AND DISTRIBUTION OF PATIENTS IN THE DEPARTMENT OF ORTHODONTICS, INFIRMARY OF DENTAL COLLEGE, Y-UNIVERSITY (Y대학교 부속병원 교정과에 내원한 부정교합 환자의 분류 및 분포에 관한 연구)

  • Oh, Young Jin;Ryu, Young Kyu
    • The korean journal of orthodontics
    • /
    • v.13 no.1
    • /
    • pp.63-72
    • /
    • 1983
  • The author was to study the types and distribution of malocclusion in the 1217 patients with diagnostic charts, cephalograms and study models, who have been treated from March, 1973 to August, 1982 in the Department of orthodontics, Infirmary of Dental College, Yon Sei University. The results were as follows; 1. In the Angle's classification of malocclusion, it was presented that class I malocclusion was 671 persons $(55.1\%)$, class II division 1 malocclusion was 241 persons $(19.8\%)$, class II division 2 malocclusion was 30 persons $(2.5\%)$ and class III malocclusion was 275 persons $(22.6\%)$. 2. In the Angle's class I malocclusion, the crowding was most remarkable $(39\%)$ 3. In the Angle's class II malocclusion, 88 persons $(32.5\%)$ were due to the undergrowth of the mandible, and deep bite was most frequent. 4. In the Angle's class II malocclusion, 94 persons $(34.2\%)$ were .in the pseudo type, 84 persons $(29.8\%)$ were due to the overgrowth of the mandible, and openbite and edge to edge bite were most frequent. 5. In the sexual distribution of the patients, female patients were 791 persons $(65\%)$, male patients were 426 persons $(35\%)$, and the number of females was 1.8 times than that of males. 6. In the age distribution of the patients, 572 persons $(47\%)$ were in the 9-13 years old. 7. In the regional distribution of the patients, most of them lived near the hospital.

  • PDF

Distributed QoS Monitoring and Edge-to-Edge QoS Aggregation to Manage End-to-End Traffic Flows in Differentiated Services Networks

  • Kim, Jae-Young;James Won-Ki Hong
    • Journal of Communications and Networks
    • /
    • v.3 no.4
    • /
    • pp.324-333
    • /
    • 2001
  • The Differentiated Services (Diffserv) framework has been proposed by the IETF as a simple service structure that can provide different Quality of Service (QoS) to different classes of packets in IP networks. IP packets are classified into one of a limited number of service classes, and are marked in the packet header for easy classification and differentiated treatments when transferred within a Diffserv domain. The Diffserv framework defines simple and efficient QoS differentiation mechanisms for the Internet. However, the original Diffserv concept does not provide a complete QoS management framework. Since traffic flows in IP networks are unidirectional from one network point to the other and routing paths and traffic demand get dynamically altered, it is important to monitor end-to-end traffic status, as well as traffic status in a single node. This paper suggests a distributed QoS monitoring method that collects the statistical data of each service class in every Diffserv router and calculates edge-to-edge QoS of the aggregated IP flows by combining routing topology and traffic status. A format modeling of edge-to-edge Diffserv flows and algorithms for aggregating edge-to-edge QoS is presented. Also an SNMP-based QoS management prototype system for Diffserv networks is presented, which validates our QoS management framework and demonstrates useful service management functionality.

  • PDF

Using Mean Shift Algorithm and Self-adaptive Canny Algorithm for I mprovement of Edge Detection (경계선 검출의 향상을 위한 Mean Shift 알고리즘과 자기 적응적 Canny 알고리즘의 활용)

  • Shin, Seong-Yoon;Pyo, Seong-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.7
    • /
    • pp.33-40
    • /
    • 2009
  • Edge detection is very significant in low level image processing. However, majority edge detection methods are not only effective enough cause of the noise points' influence, even not flexible enough to different input images. In order to sort these problems, in this paper an algorithm is presented that has an extra noise reduction stage at first, and then automatically selects the both thresholds depending on gradient amplitude histogram and intra class minimum variance. Using this algorithm, can fade out almost all of the sensitive noise points, and calculate the propose thresholds for different images without setting up the practical parameters artificially, and then choose edge pixels by fuzzy algorithm. In finally, get the better result than the former Canny algorithm.

MAXILLARY INCISOR CROWN-ROOT ANGLE(COLLUM ANGLE) IN DIFFERENT MALOCCLUSIONS (부정교합 분류에 따른 상악 중절치의 치관-치근 각도(Collum Angle)에 대한 연구)

  • Hong, Hee-Sook;Baik, Hyoung-Seon
    • The korean journal of orthodontics
    • /
    • v.25 no.4
    • /
    • pp.453-463
    • /
    • 1995
  • Most commonly used axis for central incisors in lateral cephalometric radiographs is the line connecting root apex and incisor edge. However, crown axis and root axis do not always coincide in cases of malocclusion patients. The angle created by these axis are called the collum angle, which should be considered in orthodontic diagnosis and treatment. In this study, 31 Class I malocclusion, 30 Class II division 1 malocclusion, 31 Class II division 2 malocclusion, and 31 Class m malocclusion patients were selected and their collum angles were measured. Correlation between these angles and malocclusions was investigated, and the correlation analysis with other parameters in cephalometrics was done. The results were as follows ; 1. The mean collum angles according to the types of malocclusions are ; $3.11^{\circ}{\pm}3.54^{\circ}$ for Class I, $1.23^{\circ}{\pm}2.41^{\circ}$ for Class II division 1, $3.77^{\circ}{\pm}4.39^{\circ}$ for Class II division 2, and $3.90^{\circ}{\pm}4.08^{\circ}$ for Class III malocclusion. 2. Statistically significant differences in collum angles were noted between Class II division 1 group and Class II division 2 and Class III group. 3. Significant correlations were found between collum angles and other parameters used in cephalometrics, namely IMPA for Class I, Wits for Class II division 1, Overbite for Class II division 2 and for ClassIII.

  • PDF

Automatic Edge Class Formulation for Classified Vector Quantization

  • Jung, jae-Young
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.4 no.2
    • /
    • pp.57-61
    • /
    • 1999
  • In the field of image compression, Classified Vector Quantization(CVQ) reveals attractive characteristics for preserving perceptual features, such as edges. However, the classification scheme is not generalized to effectively reconstruct different kinds of edge patterns in the original CVQ that predefines several linear-type edge classes: vortical edge horizontal edge diagonal edge classes. In this paper, we propose a new classification scheme, especially for edge blocks based on the similarity measure for edge patterns. An edge block is transformed to a feature vector that describes the detailed shape of the edge pattern The classes for edges are formulated automatically from the training images to result in the generalization of various shapes of edge patterns. The experimental results show the generated linear/nonlinear types of edge classes. The integrity of all the edges is faithfully preserved in the reconstructed image based on the various type of edge codebooks generated at 0.6875bpp.

  • PDF

Cost Maximization Approach to Edge Detection Using a Genetic Algorithm (유전자 알고리즘을 이용한 비용 최대화에 의한 에지추출)

  • 김수겸;박중순
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.21 no.3
    • /
    • pp.293-301
    • /
    • 1997
  • Edge detection is the first step and very important step in image analysis. We cast edge detec¬tion as a problem in cost maximization. This is acheived by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for compar¬ing the performances of different detectors. We used a Genetic Algorithm for maximizing cost func¬tion. Genetic algorithms are a class of adaptive search techniques that have been intensively stud¬ied in recent years and have been prone to converge prematurely before the best solution has been found. This paper shows that carefully chosen modifications(three factors of the crossover opera¬tor) are implemented can be effective in alleviating this problem.

  • PDF

Rate-Compatible LDPC Codes Based on the PEG Algorithm for Relay Communication Systems

  • Zhou, Yangzhao;Jiang, Xueqin;Lee, Moon Ho
    • Journal of Communications and Networks
    • /
    • v.17 no.4
    • /
    • pp.346-350
    • /
    • 2015
  • It is known that the progressive edge-growth (PEG) algorithm can be used to construct low-density parity-check (LDPC) codes at finite code lengths with large girths through the establishment of edges between variable and check nodes in an edge-by-edge manner. In [1], the authors derived a class of LDPC codes for relay communication systems by extending the full-diversity root-LDPC code. However, the submatrices of the parity-check matrix H corresponding to this code were constructed separately; thus, the girth of H was not optimized. To solve this problem, this paper proposes a modified PEG algorithm for use in the design of large girth and full-diversity LDPC codes. Simulation results indicated that the LDPC codes constructed using the modified PEG algorithm exhibited a more favorable frame error rate performance than did codes proposed in [1] over block-fading channels.