• Title/Summary/Keyword: 공간적 계층구조

Search Result 283, Processing Time 0.027 seconds

Hierarchical Bayesian analysis for a forest stand volume (산림재적 추정을 위한 계층적 베이지안 분석)

  • Song, Se Ri;Park, Joowon;Kim, Yongku
    • Journal of the Korean Data and Information Science Society
    • /
    • v.28 no.1
    • /
    • pp.29-37
    • /
    • 2017
  • It has gradually become important to estimate a forest stand volume utilizing LiDAR data. Recently, various statistical models including a linear regression model has been introduced to estimate a forest stand volume using LiDAR data. One of limitations of the current approaches is in that the accuracy of observed forest stand volume data, which is used as a response variable, is questionable unstable. To overcome this limitation, we consider a spatial structure for a forest stand volume. In this research, we propose a hierarchical model for applying a spatial structure to a forest stand volume. The proposed model is applied to the LiDAR data and the forest stand volume for Bonghwa, Gyeongsangbuk-do.

Constant Time Algorithm for the Window Operation of Linear Quadtrees on RMESH (RMESH구조에서 선형 사진트리의 윈도우 연산을 위한 상수시간 알고리즘)

  • Kim, Kyung-Hoon;Jin, Woon-Woo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.3
    • /
    • pp.134-142
    • /
    • 2002
  • Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The window operation is one of important geometry operations in image processing, which extracts a sub-image indicated by a window in the image. In this paper, we present an algorithm to perform the window operation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\times}n{\times}n$ RMESH.

Constant Time Algorithms for Region Expansion and Scaling of Linear Quadtrees on RMESH (RMESH 구조에서 선형 사진트리의 영역 확장과 스케일링을 위한 상수시간 알고리즘)

  • Woo, Jin-Woon
    • The KIPS Transactions:PartA
    • /
    • v.11A no.3
    • /
    • pp.173-180
    • /
    • 2004
  • Quadtree, which 11 a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related to quadtrees. The region expansion is an operation to expand images by a given distance and the scaling If an operation to scale images by a given scale factor. In this paper, we present algorithms to perform the region expansion and scaling of images represented by quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). These algorithms have constant time complexities by using efficient basic operations to route the locational codes of quadtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

A Study on the Netted Radar Information Network (Jamming 효과를 고려한 Netted 레이다의 정보통합망 설계에 관한 연구)

  • 김춘길;이형재
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.4
    • /
    • pp.398-414
    • /
    • 1992
  • For designing the radar integrated data network, we construct the network structure with a spatial hierarchy decomposition scheme. The RIDN can be decomposed into several subnet classes, those of which are composed of the several group classes of radar sits, In a group class, the communication nodes of a radar site are modeled by the software modules formulated with the statistical attributes of discrete events. And we get the analysis over the network through the separately constructed infra group level models which were coded with the C language. After constructing the local area network with these infra models through the proper data links. We got the analysis of the communication performance of inner models and the global network.

  • PDF

Korean Approximate String Searching System by Hierarchical Metric Space Structure (계층적 메트릭 공간(metric space) 구조의 한글 근사 단어 검색 시스템)

  • Yoon, Taijin;Cho, Hwan-Gue
    • Annual Conference of KIPS
    • /
    • 2010.04a
    • /
    • pp.397-400
    • /
    • 2010
  • 우리는 지난 연구에서 변형 비속어 필터링 시스템을 위하여 근사 문자열 검색 시스템을 적용하여 서열 정렬 횟수를 비약적으로 줄일 수 있었다. 다차원 데이터 구조를 이용한 한글 근사 검색 시스템은 기준축인 Base-Pivot의 숫자에 따라 검색 결과의 정확도를 높일 수 있으나 BP이 증가한 만큼 질의 단어의 좌표를 계산하기 위한 시간이 오래 걸린다. 소규모 데이터 검색에는 문제가 되지 않으나 60,000단어 이상의 데이터가 수록되는 국어사전과 같은 대규모 데이터를 검색하게 될 경우 요구되는 BP의 숫자도 증가하여 많은 연산시간을 필요로 한다. 본 논문에서는 기존의 근사 단어 검색 시스템을 계층구조화 하여 요구되는 BP 숫자를 감소 시켜 성능을 향상 시키는 방법을 제안하고자 한다. 그리고 실험을 통하여 본 아이디어의 실효성을 증명하였다. 본 아이디어는 기존의 6000개의 비속어에 대하여 약 20%정도의 성능향상을 보였다.

Den of I/O Controller for Future Communication Platform (차세대 통신 플랫폼을 위한 입출력 컨트롤러 설계)

  • Hyun Eugin;Seong Kwang-Su
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.42 no.4 s.304
    • /
    • pp.59-68
    • /
    • 2005
  • In this paper, we design a PCI Express controller for future communication system The controller supports the full functionality of Transaction Layer and Data Link Layer of PCI Express. The designed controller has the proposed transmitter buffer architecture to obey Replay mechanism. This scheme merges the transmitting buffer and the replay buffer. The proposed buffer has the higher data transfer efficiency than the conventional buffer architecture because it can dynamically adjust size of a replay buffer space. We also design transmitter of Transmitter Transaction Layer to effectively support the proposed buffer, The receiver device of PCI Express must possess the buffer for three types of transaction to support Flow Control. And it must report the amount of the buffer space regularly to the Port at the opposite end of the link. We propose the simple receiver buffer scheme using only one buffer to easily support Flow Control. And the designed controller is verified under proposed test bench

Efficient Processing of Buying and Selling in a Internet Distributed Virtual Place (인터넷 분산 가상 공간에서의 효율적인 구입 및 판매 처리)

  • 고민정;음두현
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04b
    • /
    • pp.85-87
    • /
    • 2002
  • 본 논문에서는 인터넷 상에서의 물품 구입 및 판매 요구를 지원하기 위한 분산 트랜잭션 처리 모델을 제시한다. 가상 공간에서의 트랜잭션 처리를 위해서는 구입 요구와 판매 요구 조건이 부합되어야 한다. 이러한 요구 사향들을 저장하기 위해 지리적인 지역 레벨에 따라 데이터베이스를 사용하고 이들을 DNS의 계층 구조와 비슷하게 연결한다. 또한 각 판매 및 구입 요구 정보를 여러 사이트에 복제 저장함으로써 판매 및 구입 요구가 발생하면 부합되는 구입 및 판매 요구를 검색하는 시간을 줄일 수 있다. 판매 및 구입 요구 정보를 저장하는 방식에 따른 검색 시간에 대한 복잡도를 분석하여 제시하였다.

  • PDF

An Ambient Service Model for Providing Web's Stores Information on Map Interface Hierarchically through User-Context-Based Search (사용자 상황기반 검색을 통해 웹상의 상점정보를 지도상에 계층적으로 제공하는 엠비언트 서비스 모델)

  • Seo, Kyung-Seok;Lee, Ryong;Jang, Yong-Hee;Kwon, Yang-Jin
    • Spatial Information Research
    • /
    • v.18 no.2
    • /
    • pp.57-65
    • /
    • 2010
  • Users often visit many stores while comparing the products for purchasing products or products related to it. Given a service providing location information of these stores, users can make their purchase efficiently because of reducing the time and effort they spent for wandering around and obtaining new purchase opportunities by knowing a kind of relevant stores near there. In this paper, for the purpose of providing relevant stores information efficiently, we suggest an Ambient Service Model that consists of three layers: "structured(purchase-related) information space", "real space", and "ambient information space". In the model, stores information collected from the web is grouped and structured automatically by relationships in terms of purchase. And users search relevant stores information by using an Ambient Query that is created by their context in real space. Finally, users obtain relevant stores information that is in the form of hierarchy structure on map interface. Then, users can search other kinds of relevant stores information additionally by using hierarchy structure. Consequently, It is possible to develope a service that users can obtain relevant stores information intuitively without complex search processes through the model. Also, we expect that the model can be used for developing services that provide objects information related to various objects besides stores.

Fast Intermode Decision of Scalable Video Coding using Statistical Hypothesis Testing (스케일러블 비디오 부호화에서 통계적 가설 검증 기법을 이용한 프레임 간 모드 결정)

  • Lee, Bum-Shik;Kim, Mun-Churl;Hahm, Sang-Jin;Lee, Keun-Sik;Park, Keun-Soo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2006.11a
    • /
    • pp.111-115
    • /
    • 2006
  • 스케일러블 비디오 코딩(SVC, Scalable Video Coding)은 MPEG(Moving Picture Expert Group)과 VCEG (Video Coding Expert Group)의 JVT(Joint VIdeo Team)에 의해 현재 표준화 되고 있는 새로운 압축 표준 기술이며 시간, 공간 및 화질의 스케일러빌리티를 지원하기 위해 계층 구조를 가지고 있다. 특히 시간적 스케일러빌리티를 위해 계층적 B-픽처 구조를 채택하고 있다. 스케일러블 비디오 코딩의 기본 계층은 H.264|AVC와 호환적이므로, 모션 예측과 모드 결정과정에서 $16{\times}16,\;16{\times}8,\;8{\times}16,\;8{\times}8,\;8{\times}4,\;4{\times}8$ 그리고 $4{\times}4$와 같은 7개의 서로 다른 크기를 갖는 블록을 사용한다. 스케일러블 비디오 코딩에서 사용되고있는 계층적 B-픽처 구조는 키 픽처인 I와 P 픽처를 제외하고는 한 GOP (Group of Picture)내에서 모두 B-픽처를 사용하므로 H.264|AVC와 비교했을 때 연산량 증가와 함께 부호화 지연도 급격히 증가한다. B-픽처는 양방향 모션 벡터인 LIST0와 LIST1을 사용하고 양방향 모두에서 다중 참조 픽처를 사용하기 때문이다. 본 논문에서는 통계적 가선 검증을 이용하여 스케일러블 비디오 부호화에 적용 가능한 고속 프레임간 모드 결정 알고리듬 대해 소개한다. 제안된 방법은 $16{\times}16$ 매크로 블록과 $8{\times}8$ 서브 매크로 블록에 통계적 가설 감증 기법을 적용하여 실행되며, 현재 블록과 복원된 참조 블록간의 픽셀 값을 비교하여 RD(Rate Distortion) 최적화 기반 모드 결정을 빨리 완료함으로써 고속 프레임간 모드 결정을 가능하게 한다. 제안된 방법은 프레임 간 모드 결정을 고속화함으로써 스케일러블 비디오 부호화기의 연산량과 복잡도를 최대 57%감소시킨다. 그러나 연산량 감소에 따른 비트율의 증가나 화질의 열화는 최대 1.74% 비트율 증가 및 0.08dB PSNR 감소로 무시할 정도로 작다.

  • PDF

A Comprehensive Representation Model for Spatial Relations among Regions and Physical Objects considering Property of Container and Gravity (Container 성질과 중력을 고려한 공간과 객체의 통합적 공간관계 표현 모델)

  • Park, Jong-Hee;Lim, Young-Jae
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.3
    • /
    • pp.194-204
    • /
    • 2010
  • A space, real or virtual, comprises regions as its parts and physical objects residing in them. A coherent and sophisticated representaion scheme for their spatial relations premises the precision and plausibility in its associated agents' inferencing on the spatial relations and the development of events occurring in such a space. The existing spatial models are not suitable for a comprehensive representation of the general spatial relations in that they have limited expressive powers based on the dichotomy between the large and small scales, or support only a small set of topological relations. The representaion model we propose has the following distinctive chracteristics: firstly, our model provides a comprehensive representation scheme to accommodate large and small scale spaces in an integrated fashion; secondly, our model greatly elaborated the spatial relations among the small-scale objects based on their contact relations and the compositional relations among their respective components objects beyond the basic topological relations like disjoint and touch; thirdly, our model further diversifies the types of supported relations by adding the container property besides the soildness together with considering the gravity direction. The resulting integrated spatial knowledge representation scheme considering the gravity allows the diverse spatial relations in the real world to be simulated in a precise manner in relation to the associated spatial events and provides an expression measure for the agents in such a cyber-world to capture the spatial knowledge to be used for recognizing the situations in the spatial aspects.