• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.1-10
• /
• 2010

Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.4
• /
• pp.429-435
• /
• 2009

This paper propose color assessment method using HSI model to evaluate quantitative quality of mosaic images by aerial digital frame camera. Firstly, we convert RGB color into HSI model and we extract six pixel information of S and I corresponding to H from adjacency image by using HSI model. Secondly, a method to measure similarity and contrast is proposed and performed for assesment of observation regarding adjacency images. Through these procedure, we could generate four parameters. We could observe that both of the evaluation results by proposed method and the evaluation results by visual were almost similar. This facts support that our method based on several formula can be an objective method to evaluate a quality of mosaic images itself.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.38-46
• /
• 2004

Image segmentation is the task which partitions the image into meaningful regions and considered to be one of the most important steps in computer vision and image processing. Image segmentation is also widely used in object-based video compression such as MPEG-4 to extract out the object regions from the given frame. Watershed algorithm is frequently used to obtain the more accurate region boundaries. But, it is well known that the watershed algorithm is extremely sensitive to gradient noise and usually results in oversegmentation. To solve such a problem, we propose an image segmentation method which is robust to noise by using stabilized inverse diffusion equation (SIDE) and is more efficient in segmentation by employing multiresolution approach. In this paper, we apply both the region projection method using labels of adjacent regions and the region merging method based on region adjacency graph (RAG). Experimental results on noisy image show that the oversegmenation is reduced and segmentation efficiency is increased.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.27-33
• /
• 2015

In this paper, we consider a joint frequency-domain scheduling and user-pairing problem for virtual MIMO in the single carrier frequency division multiple access (SC-FDMA) system, e.g., the uplink transmission for third generation partnership project-long term evolution (3GPP-LTE) standard. Due to the subcarrier adjacency constraint inherent to SC-FDMA, its complexity becomes unmanageable. We propose a greedy heuristic algorithm for PF scheduling so as to deal with the complexity issue in this joint problem. It has been shown that its performance can reach up to 90% of its upper bound.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.72-75
• /
• 2008

Image segmentation techniques becoming increasingly important in the field of remote sensing image analysis in areas such as object oriented image classification. This paper presents a new method for image segmentation in High Resolution Remote Sensing Image based on Seeded Region Growing (SRG) and Edge Information. Firstly, multi-spectral edge detection was done using an entropy operator in pan-sharpened QuickBird imagery. Then, the initial seeds were automatically selected from the obtained edge map. After automatic selection of significant seeds, an initial segmentation was achieved by applying SRG. Finally the region merging process, using region adjacency graph (RAG), was carried out to get the final segmentation result. Experimental results demonstrated that the proposed method has good potential for application in the segmentation of high resolution satellite images.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.825-828
• /
• 2000

본 논문은 IETF에서 레이블 스위치를 제어하기 위하여 표준화가 진행 중인 GSMP 프로토콜에 보안 서비스를 추가하여 네트워크에서 가능한 공격이나 위협과 같은 보안 문제에 대한 해결책을 검토하고 있다. GSMP 프로토콜의 Adjacency 메시지를 통하여 스위치와 컨트롤러사이에 동기화 설정과정에 보안서비스를 위한 정보요소를 추가하여 GSMP 프로토콜에서 메시지 인증, 기밀성, 무결성 보안 서비스를 제공한다. 인증 서비스를 제공하여 메시지에 대한 정당성을 검증중하고 기밀성과 무결성 서비스를 제공하여 메시지의 변조나 재생과 같은 공격을 막을 수 있을 것이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6B
• /
• pp.810-819
• /
• 2001

칼라가 물체 인식에 아주 효율적인 단서를 제공하지만 칼라 분포는 시청 조건과 카메라의 위치에 아주 큰 영향을 받는다. 생김새와 모양의 변화에 의한 칼라 분포 변화 문제를 해결하기 위해 본 논문에서는 밝기 값의 변화에 영향을 받지 않고, 색상(hue) 성분에 민감한 칼라 벡터각(color vector angle)을 이용하여 칼라 에지를 추출한 후, 영상의 화소들을 평탄 화소와 에지 화소로 구분하여 칼라 특징 값을 추출하였다. 에지 화소의 경우에는 에지 주위 칼라 쌍의 전체 분포를 HLS 색좌표계의 비균일 양자화를 통해 칼라 인접 히스토그램(color adjacency histogram)으로 표현하고, 평탄 화소의 경우에는 HLS 색좌표계의 비균일 양자화와 칼라 벡터각 균일 양자화를 통해 칼라 벡터각 히스토그램(color vector angle histogram)을 구성하여 공간적인 칼라분포를 표현하였다. 제안한 칼라 히스토그램을 이용하여 영상 검색에 적용하여 성능을 실험한 결과, 작은 빈의 수를 가지는 제안한 방법이 기존의 방법들보다 훨씬 효율적이고, 생김새와 모양의 변화에 아주 강건한 영상 검색이 가능하였고, 기존의 칼라 히스토그램 역투사 방법보다 훨씬 정확한 물체 위치 추정이 가능함을 확인할 수 있었다.

• Journal of Intelligence and Information Systems
• /
• v.2 no.1
• /
• pp.45-58
• /
• 1996

This paper describes an a, pp.oach to recognizing composite features of prismatic parts. AAG (Attribute Adjacency Graph) is adopted as the basis of describing basic feature, but it is extended to enhance the expressive power of AAG by adding face type, angles between faces and normal vectors. Our a, pp.oach is called Extended AAG (EAAG). To simplify the recognition procedure, feature classification tree is built using the graph types of EEA and the number of EAD's. Algorithms to find open faces and dimensions of features are exemplified and used in decomposing composite feature. The processing sequence of recognized features is automatically determined during the decomposition process of composite features.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.773-775
• /
• 2013

In this paper, we consider the problem for finding a vertex sequence of the directed cycle graph from the individual neighborhood information on a reconfigurable mesh(in short, RMESH). This problem can be solved in linear time using a sequential algorithm. However, it is difficult to develop a sublinear time parallel algorithm for the problem because of its sequential nature. All kinds of polygons can be represented by directed cycles, hence a solution of the problem may be used to solving problems in which a polygon should be constructed from the adjacency information for each vertex. In this paper, we present a constant time $n{\times}n^2$ RMESH algorithm for the problem with n vertices.

• Korean Management Science Review
• /
• v.19 no.1
• /
• pp.67-75
• /
• 2002

This paper deals with the visualization method of solutions of the linear programming Problem. We used the revised simplex method for the LP algorithm. To represent the solutions at each iteration, we need the informations of feasible legion and animated effect of solutions. For the visualization in high dimension space, we used the method of Projection to the three dimensions if the decision variable vector is over three dimensions, and we studied the technique of preserving original Polyhedral information such as the number of vertices. In addtion, we studied the method of visualizing unbounded feasible region and the adjacency relationship of the vortices welch is Indispensable to cisualize feasible legion.