• Title/Summary/Keyword: spatial neighbor

Search Result 171, Processing Time 0.027 seconds

An Advanced Scheme for Searching Spatial Objects and Identifying Hidden Objects (숨은 객체 식별을 위한 향상된 공간객체 탐색기법)

  • Kim, Jongwan;Cho, Yang-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1518-1524
    • /
    • 2014
  • In this paper, a new method of spatial query, which is called Surround Search (SuSe) is suggested. This method makes it possible to search for the closest spatial object of interest to the user from a query point. SuSe is differentiated from the existing spatial object query schemes, because it locates the closest spatial object of interest around the query point. While SuSe searches the surroundings, the spatial object is saved on an R-tree, and MINDIST, the distance between the query location and objects, is measured by considering an angle that the existing spatial object query methods have not previously considered. The angle between targeted-search objects is found from a query point that is hidden behind another object in order to distinguish hidden objects from them. The distinct feature of this proposed scheme is that it can search the faraway or hidden objects, in contrast to the existing method. SuSe is able to search for spatial objects more precisely, and users can be confident that this scheme will have superior performance to its predecessor.

Color Image Quantization and Dithering Method based on HVS Characteristics

  • Ha, Yeong-Ho
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.569-574
    • /
    • 1999
  • New methods for both color palette design and dithering based on human visual system (HVS) characteristics are proposed. Color quantization for palette design uses the relative visual sensitivity and spatial masking effect of HVS. The dithering operation for printing uses nonlinear quantization, which considers the overlapping phenomena among neighbor printing dots, and then a modified dot-diffusion algorithm is followed to compensate the degradation produced in the quantization process. The proposed techniques can produce high quality image in the low-bit color devices.

  • PDF

MAC Protocols for Ad Hoc Networks with Directional Antennas: Overview and Comparison

  • Khatiwada, Bipula;Moh, Sang-Man
    • Information and Communications Magazine
    • /
    • v.28 no.12
    • /
    • pp.69-82
    • /
    • 2011
  • In recent years, the employment of directional antennas in ad hoc networks has significantly increased. MAC protocols for ad hoc networks with directional antennas have the potentiality of spatial reuse, large coverage range and network capacity, which mitigates the negative effects associated with omnidirectional antenna systems. However, they suffer from some issues such as hidden terminal problems, deafness, neighbor discovery, flaws with directional carrier sensing, etc. In this paper, we have surveyed the MAC protocols for ad hoc networks with directional antennas, which have been published in the literature, and compared them qualitatively in terms of major characteristics and network performances.

A Study on Forest Fire Detection from MODIS Data Using Local Spatial Association Analysis (국지적 공간상관분석을 이용한 MODIS영상에서의 산불탐지에 관한 연구)

  • Byun, Young-Gi;Huh, Yong;Kim, Yong-Min;Yu, Ki-Yun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.15 no.1 s.39
    • /
    • pp.23-29
    • /
    • 2007
  • Spatial outliers in remotely sensed imagery represent observed quantities showing unusual values compared to their neighbor pixel values. There have been various methods to detect the spatial outliers based on spatial autocorrelations in statistics and data mining. These methods may be applied in detecting forest fire pixels in the MODIS imageries from NASA's AQUA satellite. This is because the forest fire detection can be referred to as finding spatial outliers using spatial variation of brightness temperature. In this paper, we propose a new forest fire detection algorithm which is based on local spatial association analysis, and test the proposed algorithm to evaluate its applicability. In order to evaluate the proposed algorithm, the results were compared with the MODIS fire product provided by the NASA MODIS Science Team, which showed the possibility of the proposed algorithm in detecting the fire pixels.

  • PDF

Spatial Distribution Pattern of Patches of Erythronium japonicum at Mt. Geumjeong in Korea (한국 금정산에 븐포하고 있는 얼레지의 공간적 분포 양상과 집단 구조)

  • Man Kyu Huh
    • Journal of Life Science
    • /
    • v.33 no.3
    • /
    • pp.227-233
    • /
    • 2023
  • The purpose of this paper was to describe a statistical analysis for the spatial distribution of geographical distances of Erythronium japonicum at Mt. Geumjeong in Korea. The spatial pattern of E. japonicum was analyzed according to the nearest neighbor rule, population aggregation under different plot sizes by dispersion indices, and spatial autocorrelation. Most natural plots of E. japonicum were uniformly distributed in the forest community. Disturbed plots were aggregately distributed within 5 m × 5 m of one another. Neighboring patches of E. japonicum were predominantly 7.5~10 m apart on average. If the natural populations of E. japonicum were disturbed by human activities, then the aggregation occurred in a shorter distance than the 7.5~10 m distance scale. The Morisita index (IM) is related to the patchiness index (PAI) that showed the 2.5 m × 5 m plot had an overly steep slope at the west and south areas when the area was smaller than 5 m × 5 m. When the patch size was one 2.5 m × 5 m quadrat at the west distributed area of Mt. Geumjeong, the cluster was determined by both species characteristics and environmental factors. The comparison of Moran's I values to a logistic regression indicated that individuals in E. japonicum populations at Mt. Geumjeong could be explained by isolation by distance.

A K-Nearest Neighbour Query Processing Algorithm for Encrypted Spatial Data in Road Network (도로 네트워크 환경에서 암호화된 공간데이터를 위한 K-최근접점 질의 처리 알고리즘)

  • Jang, Mi-Young;Chang, Jae-Woo
    • Spatial Information Research
    • /
    • v.20 no.3
    • /
    • pp.67-81
    • /
    • 2012
  • Due to the recent advancement of cloud computing, the research on database outsourcing has been actively done. Moreover, the number of users who utilize Location-based Services(LBS) has been increasing with the development in w ireless communication technology and mobile devices. Therefore, LBS providers attempt to outsource their spatial database to service provider, in order to reduce costs for data storage and management. However, because unauthorized access to sensitive data is possible in spatial database outsourcing, it is necessary to study on the preservation of a user's privacy. Thus, we, in this paper, propose a spatial data encryption scheme to produce outsourced database from an original database. We also propose a k-Nearest Neighbor(k-NN) query processing algorithm that efficiently performs k-NN by using the outsourced database. Finally, we show from performance analysis that our algorithm outperforms the existing one.

Using Voronoi Diagram and Power Diagram in Application Problems (응용문제에서 보로노이 다이어그램과 파워 다이어그램의 사용성 비교)

  • Kim, Donguk
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.4
    • /
    • pp.235-243
    • /
    • 2012
  • The Voronoi diagram of spheres and power diagram have been known as powerful tools to analyze spatial characteristics of weighted points, and these structures have variety range of applications including molecular spatial structure analysis, location based optimization, architectural design, etc. Due to the fact that both diagrams are based on different distance metrics, one has better usability than another depending on application problems. In this paper, we compare these diagrams in various situations from the user's viewpoint, and show the Voronoi diagram of spheres is more effective in the problems based on the Euclidean distance metric such as nearest neighbor search, path bottleneck locating, and internal void finding.

A Nearest Neighbor Query Processing Algorithm Supporting K-anonymity Based on Weighted Adjacency Graph in LBS (위치 기반 서비스에서 K-anonymity를 보장하는 가중치 근접성 그래프 기반 최근접 질의처리 알고리즘)

  • Jang, Mi-Young;Chang, Jae-Woo
    • Spatial Information Research
    • /
    • v.20 no.4
    • /
    • pp.83-92
    • /
    • 2012
  • Location-based services (LBS) are increasingly popular due to the improvement of geo-positioning capabilities and wireless communication technology. However, in order to enjoy LBS services, a user requesting a query must send his/her exact location to the LBS provider. Therefore, it is a key challenge to preserve user's privacy while providing LBS. To solve this problem, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, 2PASS does not fully guarantee the actual user privacy because it does not take the real user distribution into account. Hence, in this paper, we propose a nearest neighbor query processing algorithm that supports K-anonymity property based on the weighted adjacency graph(WAG). Our algorithm not only preserves the location of a user by guaranteeing k-anonymity in a query region, but also improves a bandwidth usage by reducing unnecessary search for a query result. We demonstrate from experimental results that our algorithm outperforms the existing one in terms of query processing time and bandwidth usage.

The Relationship between the User's Perception of Socio-cultural Attributes and the Spatial Structures of Dwelling Spaces - a Comparative Study between Korean and German Housings - (거주자의 대 사회적 개념과 주거공간의 영역별 구성체계와의 관계 - 한국과 독일의 주거형태학적 비교관찰을 통하여 -)

  • 전남일
    • Journal of the Korean housing association
    • /
    • v.13 no.5
    • /
    • pp.31-42
    • /
    • 2002
  • This comparative study between Korean and German housings aims at understanding different structural systems in the indoor and outdoor spaces, depending upon the user′s perception of the socio-cultural attributes. The analysis starts with four alternative contrary assumptions, that appear in morphological forms of dwelling; 1) linear distribution vs. areal distribution of residential districts, 2) mirror system vs. comb system in the layout of plot plans 3) organization of front vs. back outdoor spaces and 4) opening vs. closing in the indoor spaces. A clear difference is found between Korean and German samples in view of public and private relationships between indoor and outdoor spaces as well as the intermediate space. In the korean housing there always exists a symbolic and psychological territory of a certain sphere. On the other hand, outdoor space passes through various phases only to form a certain hierarchy even in a private space and, thereby, sets a boundary between private and public areas. In the case of Germany, the building itself draws a clear line between private and public outdoor spaces, and therefore the outdoor space has a "front" and "back". Thus, Germany′s private space may face a genuine public space and street, which is rare in the Korean housing. Although the layout of indoor space in the korean housing tends to be open, such an openness may be outstanding in living and dining spaces, kitchen and various accesses to rooms. In the case of Germany, such indoor spaces are usually closed to each other. Thus corridors act to separate these spaces. Such differences are analysed to be due to the different perceptions of interpersonal and socio-cultural attributes as intra-family and inter-neighbor relationships or communications.