• 제목/요약/키워드: Neighbor Linking

검색결과 7건 처리시간 0.017초

Nearest neighbor and validity-based clustering

  • Son, Seo H.;Seo, Suk T.;Kwon, Soon H.
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제4권3호
    • /
    • pp.337-340
    • /
    • 2004
  • The clustering problem can be formulated as the problem to find the number of clusters and a partition matrix from a given data set using the iterative or non-iterative algorithms. The author proposes a nearest neighbor and validity-based clustering algorithm where each data point in the data set is linked with the nearest neighbor data point to form initial clusters and then a cluster in the initial clusters is linked with the nearest neighbor cluster to form a new cluster. The linking between clusters is continued until no more linking is possible. An optimal set of clusters is identified by using the conventional cluster validity index. Experimental results on well-known data sets are provided to show the effectiveness of the proposed clustering algorithm.

Efficient Classification of High Resolution Imagery for Urban Area

  • Lee, Sang-Hoon
    • 대한원격탐사학회지
    • /
    • 제27권6호
    • /
    • pp.717-728
    • /
    • 2011
  • An efficient method for the unsupervised classification of high resolution imagery is suggested in this paper. It employs pixel-linking and merging based on the adjacency graph. The proposed algorithm uses the neighbor lines of 8 directions to include information in spatial proximity. Two approaches are suggested to employ neighbor lines in the linking. One is to compute the dissimilarity measure for the pixel-linking using information from the best lines with the smallest non. The other is to select the best directions for the dissimilarity measure by comparing the non-homogeneity of each line in the same direction of two adjacent pixels. The resultant partition of pixel-linking is segmented and classified by the merging based on the regional and spectral adjacency graphs. This study performed extensive experiments using simulation data and a real high resolution data of IKONOS. The experimental results show that the new approach proposed in this study is quite effective to provide segments of high quality for object-based analysis and proper land-cover map for high resolution imagery of urban area.

RAG 기반 다중 창 영상 분할 (1) (RAG-based Image Segmentation Using Multiple Windows)

  • 이상훈
    • 대한원격탐사학회지
    • /
    • 제22권6호
    • /
    • pp.601-612
    • /
    • 2006
  • 본 연구는 방대한 크기 원격 탐사 영상 자료의 효율적인 분석을 위한 RAG (Region Adjancency Graph) 기반 영상 분할 기법을 제안하고 있다. 제안된 알고리즘은 계산의 효율성을 위하여 CN-chain 연결과 저장 기억의 효율성을 위하여 sliding 다중 창을 사용한다. RAG에 의한 지역 합병은 최선의 결합을 위한 edge을 발견과 합병에 따른 graph의 갱신의 과정이다. CN-chain 연결법은 가장 유사한 인접 지역의 연결을 형성하면서 최선의 edge를 발견하여 합병을 해 나가는 과정으로 영상 자료 크기의 증가에 따라 단지 증가 배수만큼만 분석 시간을 증가시킨다. 합병에 의해 변하는 RAG의 효율적인 갱신을 위하여 RNV(Regional Neighbor Vector)를 사용하였다. 방대한 크기 자료 분석은 막대한 기억 용량의 시스템을 필요로 한다. 제안된 수평적인 구조의 sliding 다중 창 작업은 필요한 기억 용량을 현저히 감소시켜 가능한 분석 자료의 크기를 증대시켰을 뿐 아니라 계산 시간의 감소를 초래하였다. 본 연구는 simulation 자료를 사용하여 광범위하게 제안된 알고리즘의 성능을 실험하였으며 실험 결과는 알고리즘의 효율성을 입증하였다.

Gene Structure and Phylogenetic Analysis of Cytohesin Family

  • Kim, Heui-Soo;Shin, Kyung-Mi;Lee, Ji-Won;Yi, Joo-Mi
    • Journal of Life Science
    • /
    • 제11권1호
    • /
    • pp.39-41
    • /
    • 2001
  • Cytohesin family has been thought to participate in inside-outside signaling linking growth factor receptor stimulation of PI 3-kinase to cell adhesion and stimulate nucleotide exchange of ARF through its Sec7 domain. The genomic structure of the cytohesin family was analyzed by BLAST search using cDNA and genomic DNA sequences from the GeneBank database. The cytohesin-2 was encoded by 12 exons. while the cytohesin-4 was encoded by 13 exons. The Sec7 and PH domains were not encoded by separate exons. In an analysis of retroviral integration, those two families did not contain any retroviral elements in introns or exons. The phylogenetic tree calculated by the neighbor-joining method suggests that the cytohesin-1 family was closely related to cytohesin-3 (ARNO3) family. These date could be of great use in further studies for resolving the exact function and evolution of the cytohesin family.

  • PDF

커뮤니티를 고려한 주거환경개선요소 설정 및 중요도 분석 (Importance Analysis and Establishment of Community-Based Residential Environment Improvement Items)

  • 김현진;구자훈;원제무
    • 한국주거학회논문집
    • /
    • 제20권6호
    • /
    • pp.127-134
    • /
    • 2009
  • This study initially analyzes the meaning of Community-Based Residential Environment Improvement. A residential environment improvement factor was determined through an analysis of the function, components, Planning techniques of the community, the evaluation criteria of the residential environment, and through relative literature documenting plans for the adjustment of urban and housing environments. In terms of the methodological approach, decisions were made based on the results of an expert focus-group-interview, a goodness-of-fit test, and by using the analytic network decision-making method from which the correlation among items can be considered. Results of this analysis show that the, order of importance of factors for a community-based residential environment is as follows: interactional character, cognitive character, and locational character. Furthermore, the most important aspect for each of these factors are the neighbor-hood relationship in terms of the interactional character, common consciousness for the cognitive character and place for locational character. The results of this study can be used by linking them with questionnaire items for basic resident research when a residential environment improvement project or a plan for the adjustment of urban and housing environments is planned.

계층적 슬라이싱 알고리즘을 사용한 정맥 패턴 검출 (Extraction of Vein Patterns using Hierachical Slicing Algorithm)

  • 최원석;장경식
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2009년도 춘계학술대회
    • /
    • pp.861-864
    • /
    • 2009
  • 최근에는 손의 다양한 부위에서 정맥을 인식하기 위한 생체인식 기술이 활발히 진행 중이다. 본 논문에서는 정맥 패턴을 검출하기 위한 계층적 슬라이싱 방법을 제안한다. 스캔한 정맥 이미지를 다양한 두께 값으로 슬라이싱한다. 슬라이스된 이미지에서 평균 밝기값을 구하고 이를 곡률 값으로 변환하여 정맥 후보 구역을 검출한다. 이 정맥 후보 지역을 재검색하여 중복 검출된 지점을 분석하여 실제의 정맥 패턴을 찾아낸다. 이를 통해 원래 이미지에서 정맥 패턴을 검출하는 새로운 알고리즘을 제안한다.

  • PDF

경관의 지수화 및 시각화 기법을 활용한 대전광역시 녹지비오톱 파편화 분석 (Fragmentation Analysis of Daejeon City's Green Biotope Using Landscape Index and Visualization Method)

  • 김진효;나정화;이순주;권오성;조현주;이은재
    • 한국환경복원기술학회지
    • /
    • 제19권3호
    • /
    • pp.29-44
    • /
    • 2016
  • The purpose of this study is to quantitatively and visually analyze the degree of green biotope fragmentation caused by road construction and other development work using FRAGSTATS and GUIDOS tool. Moreover, linking of the endangered species research, we mapped "Biotope Fragmentation Map" of Daejeon-city. The findings of the study are summarized as follows: First, as the result of FRAGSTATS, landscape indices : number of patch(NP), mean patch size (MPS), edge length(TE), mean nearest neighbor distance(MNN), edge shape(LSI) showed meaningful change from fragmentation. Moreover, the result of GUIDOS analysis, middle core-small core-bridge-branch-edge-islet-perforation showed increase of area percentage without large core. Lastly, analysis result of 'Biotope Fragmentation Map' revealed that changing site of large core's size appeared eighteen-site and designated as the special protection area appeared forty-one site. As the result of the two data, overlapping areas that showed both change of core size and revealed special protection areas revealed four site. For example, five species of endangered species appeared on the NO. 4 site in 'Biotope Fragmentation Map'. The findings of this study as summarized above are considered to play an important role in basic data preventing green biotope fragmentation at the planned level from various development work.