• Title/Summary/Keyword: 인접 이웃

Search Result 84, Processing Time 0.019 seconds

Edge Detection in Color Image Using Color Morphology Pyramid (컬리 모폴로지 피라미드를 이용한 컬러 이미지의 에지 검출)

  • 남태희;이석기
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.2
    • /
    • pp.65-69
    • /
    • 2001
  • Edge detection is the most important process that belongs to the first step in image recognition or vision system and can determine the efficiency valuation. The edge detection with color images is very difficult. because color images have lots of information that contain not only general information representing shape, brightness and so on but also that representing colors. In this paper, we propose architecture of universalized Color Morphological Pyramids(CMP) which is able to give effective edge detection. Image pyramid architecture is a successive image sequence whose area ratio 2$\^$-1/(ι= 1, 2, . . . ,N) after filtering and subsampling of input image. In this technique, noise removed by sequential filtering and resolution is degraded by downsampling using CMP in various color spaces. After that, new level images are constructed that apply formula using distance of neighbor vectors in close level images and detection its image.

A proposed image stitching method for web-based panoramic virtual reality for Hoseo Cyber Museum (호서 사이버 박물관: 웹기반의 파노라마 비디오 가상현실에 대한 효율적인 이미지 스티칭 알고리즘)

  • Khan, Irfan;Soo, Hong Song
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.2
    • /
    • pp.893-898
    • /
    • 2013
  • It is always a dream to recreate the experience of a particular place, the Panorama Virtual Reality has been interpreted as a kind of technology to create virtual environments and the ability to maneuver angle for and select the path of view in a dynamic scene. In this paper we examined an efficient method for Image registration and stitching of captured imaged. Two approaches are studied in this paper. First, dynamic programming is used to spot the ideal key points, match these points to merge adjacent images together, later image blending is used for smooth color transitions. In second approach, FAST and SURF detection are used to find distinct features in the images and nearest neighbor algorithm is used to match corresponding features, estimate homography with matched key points using RANSAC. The paper also covers the automatically choosing (recognizing, comparing) images to stitching method.

A Distributed Time Synchronization Technique for OFDMA-based Wireless Mesh Communication Systems Using Bio-inspired Algorithm (생체모방 알고리즘을 이용한 OFDMA 무선 메쉬 통신시스템의 분산 시간 동기화 기법 연구)

  • Kim, Mi-Jeong;Lee, Yun-Jae;Cho, Yong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.12
    • /
    • pp.1069-1078
    • /
    • 2013
  • In this paper, we propose a distributed time synchronization technique for OFDMA- based wireless mesh communication systems. The proposed technique employs the bio-inspired algorithm for self-time synchronization in the physical layer. To achieve the network synchronicity, the proposed technique updates the transmission time and the FFT window using the TDoA information of received signals from the neighbor nodes. The proposed technique can achieve fast self-synchronization among nodes with a simple algorithm, without the need of a centralized controller. The performance of the proposed time synchronization technique is evaluated by simulation in terms of convergence speed and convergence probability.

The Collision Processing Design of an Online Distributed Game Server (온라인 분산게임 서버의 충돌처리 설계)

  • Lee Sung-Ug
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.1
    • /
    • pp.72-79
    • /
    • 2006
  • Recently, a MMORPG(Massively Multi-play Online Role Playing Game) has built distribute server by Seamless world. This paper proposes an efficient collision detection method. DLS is used to dynamically adjust spatial subdivisions in each the boundary regions of distribute server We use an index table to effectively utilize the relationships between in the nodes and can perform the collision detection efficiently by reconstructing nodes of the tree. Also, we maintain the information for the boundary region to efficiently detect the collections and adjust the boundary regions between distributed servers by using DLS. As the DLS uses pointers, the information for each server is not needed and the boundary regions between the distributed servers are efficiently searched. Using node index points, the construction table can be made to find between ray and neighborhood node, In addition, processes for Network traffic reduce because a copy of the boundary regions is not needed when a object moves with realtime.

  • PDF

CAD Data Conversion to a Node-Relation Structure for 3D Sub-Unit Topological Representation (3차원 위상구조 생성을 위한 노드 - 관계구조로의 CAD 자료 변환)

  • Stevens Mark;Choi Jin-Mu
    • Journal of the Korean Geographical Society
    • /
    • v.41 no.2 s.113
    • /
    • pp.188-194
    • /
    • 2006
  • Three-dimensional topological data is essential for 3D modeling and application such as emergency management and 3D network analysis. This paper reviewed current 3D topological data model and developed a method to construct 3D topological node-relation data structure from 2D computer aided design (CAD) data. The method needed two steps with medial axis-transformation and topological node-relation algorithms. Using a medial-axis transformation algorithm, the first step is to extract skeleton from wall data that was drawn polygon or double line in a CAD data. The second step is to build a topological node-relation structure by converting rooms to nodes and the relations between rooms to links. So, links represent adjacency and connectivity between nodes (rooms). As a result, with the conversion method 3D topological data for micro-level sub-unit of each building can be easily constructed from CAD data that are commonly used to design a building as a blueprint.

Region-Based Moving Object Segmentation for Video Monitoring System (비디오 감시시스템을 위한 영역 기반의 움직이는 물체 분할)

  • 이경미;김종배;이창우;김항준
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.1
    • /
    • pp.30-38
    • /
    • 2003
  • This paper presents an efficient region-based motion segmentation method for segmenting of moving objects in a traffic scene with a focus on a Video Monitoring System (VMS). The presented method consists of two phases: motion detection and motion segmentation. Using the adaptive thresholding technique, the differences between two consecutive frames are analyzed to detect the movements of objects in a scene. To segment the detected regions into meaningful objects which have the similar intensity and motion information, the regions are initially segmented using a k-means clustering algorithm and then, the neighboring regions with the similar motion information are merged. Since we deal with not the whole image, but the detected regions in the segmentation phase, the computational cost is reduced dramatically. Experimental results demonstrate robustness in the occlusions among multiple moving objects and the change in environmental conditions as well.

The Influence of Foodscape on Young Generations' Satisfaction and Behavioral Intentions in Cafés, Johor Bahru, Malaysia (말레이시아 조호바루 지역에 거주하는 신세대 소비자들의 카페 Foodscape에 대한 만족도와 행동의도 분석)

  • Lee, Sang-Hyeop;Elaine, Kwan;Lee, Jong-Ho
    • Culinary science and hospitality research
    • /
    • v.21 no.5
    • /
    • pp.204-213
    • /
    • 2015
  • In the food and beverage industry, foodscape is known as an important component in satisfy the customer and return patronage. However, it has been overlooked in the restaurant service quality as well as less examined in the hospitality journal. Thus, it causes that the restaurant managers have little knowledge on how the foodscape influences customer satisfaction as well as behavioral intention. Therefore, the purpose of this study is to analyze the role of foodscape attributes on customer satisfaction and behavioral intention in $caf{\acute{e}}$ in Johor Bahru, Malaysia. The sample size of the questionnaire in this study was 322 respondents who are Generation Y in the age group between 18 and 35 years old. Multiple regression was used in the study to identify the relative importance of foodscape attributes that lead to customer satisfaction and behavioral intention. Through this research, the restaurant managers would aware and realize that foodscape would have relationships between customer satisfaction as well as behavioral intention.

3D Reconstruction System of Teeth for Dental Simulation (치과 진료 시뮬레이션을 위한 3차원 치아의 재구성 시스템)

  • Heo, Hoon;Choi, Won-Jun;Chae, Ok-Sam
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.133-140
    • /
    • 2004
  • Recently, the dental information systems were rapidly developed in order to store and process the data of patients. But, these systems should serve a doctor a good quality information against disease for diagnostic and surgery purpose so as to success in this field. This function of the system it important to persuade patients to undergo proper surgical operation they needed. Hence, 3D teeth model capable of simulating the dental surgery and treatment is necessary Teeth manipulation of dentistry is performed on individual tooth in dental clinic. io, 3D teeth reconstruction system should have the techniques of segmentation and 3D reconstruction adequate for individual tooth. In this paper, we propose the techniques of adaptive optimal segmentation to segment the individual area of tooth, and reconstruction method of tooth based on contour-based method. Each tooth can be segmented from neighboring teeth and alveolar bone in CT images using adaptive optimal threshold computed differently on tooth. Reconstruction of individual tooth using results of segmentation can be manipulated according to user's input and make the simulation of dental surgery and treatment possible.

Despeckling and Classification of High Resolution SAR Imagery (고해상도 SAR 영상 Speckle 제거 및 분류)

  • Lee, Sang-Hoon
    • Korean Journal of Remote Sensing
    • /
    • v.25 no.5
    • /
    • pp.455-464
    • /
    • 2009
  • Lee(2009) proposed the boundary-adaptive despeckling method using a Bayesian model which is based on the lognormal distribution for image intensity and a Markov random field(MRF) for image texture. This method employs the Point-Jacobian iteration to obtain a maximum a posteriori(MAP) estimate of despeckled imagery. The boundary-adaptive algorithm is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The boundary-adaptive scheme was comprehensively evaluated using simulation data and the effectiveness of boundary adaption was proved in Lee(2009). This study, as an extension of Lee(2009), has suggested a modified iteration algorithm of MAP estimation to enhance computational efficiency and to combine classification. The experiment of simulation data shows that the boundary-adaption results in yielding clear boundary as well as reducing error in classification. The boundary-adaptive scheme has also been applied to high resolution Terra-SAR data acquired from the west coast of Youngjong-do, and the results imply that it can improve analytical accuracy in SAR application.

The Stateless Care of Address Configuration Scheme To Provide an Efficient Internet Service in a Train (철도차량내의 효율적인 인터넷 서비스를 위한 Stateless 기반의 Care of Address 구성방안)

  • Lee, Il-Ho;Lee, Jun-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.9
    • /
    • pp.37-46
    • /
    • 2009
  • The movement of the MR loaded on the train is confined to the bidirectional movement along the rail. Therefore, the AR connected to the MR can use the address information of the neighboring ARs and configure CoA in advance before performing L2 and L3 handoff. The MR can acquire new CoA immediately from the present AR after the movement detection procedure. The performance analysis shows that the proposed scheme can provide CoA to the MR about 1.8(s) at minimum and 4.98(s) at maximum faster than the Stateless scheme because the proposed scheme does not carry out any additional CoA and DAD procedure unlike the Stateless scheme.