• Title/Summary/Keyword: range-based 기법

Search Result 1,074, Processing Time 0.035 seconds

Classification of Hyperspectral Image Pixel using Optimal Band Selection based on Discrete Range (이산 범위 기반 최적 밴드 추출을 이용한 초분광 이미지 픽셀 분류)

  • Chang, Duhyeuk;Jung, Byeonghyeon;Heo, Junyoung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.5
    • /
    • pp.149-154
    • /
    • 2021
  • Unlike or common images, Hyperspectral images were taken by continuous electromagnetic spectral into numerous bands according to wavelengths and are high-capacity high-resolution images. It has more information than ordinary images, so it is used to explore objects and materials. To reduce the amount of information in hyper-spectral images to be processed, band selection is utilized. Existing band selection techniques are heuristic techniques based on statistics, which take a long time and often lack generality and universality. To compensate for this, this paper utilizes quantization concept to draw representative bands through Discrete Range, we use them for band selection algorithm. Experimental results showed that the proposed technique performed much faster than conventional band selection methods, and that the performance accuracy was similar to that of the original even though the number of bands was reduced by one-seventh to one-tenth.

Passive Range Estimation Based on Towed Line Array in Multi-Target Environment (다중 음원 환경에서의 수동 거리 추정)

  • 양인식;김준환;김기만
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.05a
    • /
    • pp.367-370
    • /
    • 2000
  • Various methods of enhancing the performance of passive range sonar arrays have been discussed, triangulation, wavefront curvature method etc. But they are not appropriate to the methods because of very low SNR in underwater environment. We made appropriate sub-arrays in a linear array and applied to the beamformers such as a minimum variance with null constraints.

  • PDF

Efficient Processing of MAX-of-SUM Queries in OLAP (OLAP에서 MAX-of-SUM 질의의 효율적인 처리 기법)

  • Cheong, Hee-Jeong;Kim, Dong-Wook;Kim, Jong-Soo;Lee, Yoon-Joon;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.27 no.2
    • /
    • pp.165-174
    • /
    • 2000
  • Recent researches about range queries in OLAP are only concerned with applying an aggregation operator over a certain region. However, data analysts in real world need not only the simple range query pattern but also an extended range query pattern that finds ranges which satisfy a special condition specified by using several aggregation operators. In this work, we define the general form of the extended range query and propose an efficient processing method for the 'MAX -of-SUM' query, which is the representative form of the extended range query pattern. The MAX-of-SUM query finds the range which has the maximum range sum value in data cube where the size of the range is given. The proposed query processing method is based on the prediction of the scope of the range sum values. That is, the search space on the query processing can be reduced by using the result of the prediction, and hence, the query response time is also reduced.

  • PDF

Wavelet-Based Fractal Image Coding Using SAS Method and Multi-Scale Factor (SAS 기법과 다중 스케일 인자를 이용한 웨이브릿 기반 프랙탈 영상압축)

  • Jeong, Tae-Il;Gang, Gyeong-Won;Mun, Gwang-Seok;Gwon, Gi-Yong;Kim, Mun-Su
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.4
    • /
    • pp.335-343
    • /
    • 2001
  • The conventional wavelet-based fractal image coding has the disadvantage that the encoding takes a long time, since each range block finds the best domain in the image. In this Paper, we propose wavelet-based fractal image coding using SAS(Self Affine System) method and multi-scale factor. It consists of the range and domain blocks in DWT(discrete wavelet transform) region. Using SAS method, the proposed method is that the searching process of the domain block is not required, and the range block selects the domain which is relatively located the same position in the upper level. The proposed method can perform a fast encoding by reducing the computational complexity in the encoding process. In order to improve the disadvantage of SAS method which is reduced image qualify, the proposed method is improved image qualify using the different scale factors for each level. As a result, there is not influence on an image quality, the proposed method is enhanced the encoding time and compression ratio, and it is able to the progressive transmission.

  • PDF

A Anonymous Authorization Scheme Based on ECC for RFID Privacy (RFID 프라이버시를 위한 ECC기반의 익명인증기법)

  • Jin, Shi-Mei;Li, Yong-Zhen;Lee, Sang-Ho;Rhee, Chung-Sei
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3C
    • /
    • pp.293-298
    • /
    • 2008
  • Recently, with the development of mobile techniques and the consideration to conveniency of using, the research on Mobile RFID Reader technique is getting more and more attentions. Until now, all security authentication algorithms of RFID are algorithms about range between Tag and Reader. The range between Reader and backend DB is composed by wired networks, so it's supposed to be secure range. But it must be taken account of the problem of information security and privacy in wireless range during the design of Mobile RFID Reader. In this paper we design an blind signature scheme based on weil-paring finite group's ECC encryption scheme, and by using this blind signature we propose the anonymous authorization scheme to Mobile RFID Reader's users.

Range Query Processing using Space and Time Filtering in Fixed Grid Indexing (고정 그리드 인덱싱에서 공간과 시간 필터링을 이용한 범위 질의 처리)

  • Jeon, Se-Gil;Nah, Yun-Mook
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.835-844
    • /
    • 2004
  • Recently, the location-based service for moving customers is becoming one of the most important service in mobile communication area. For moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. Range queries, whose range can be window or circular, are the most essential query types in LBS. We need to distinguish completely contained cells from partially contained cells in those range queries. Also, it is necessary to consider temporal dimension to filter out qualifying objects correctly. In this paper, we adopt two-level index structures with fixed grid file structures in the second level, which are designed to minimize update operations. We propose a spatial ceil filtering method using VP filtering and a combined spatio-temporal filtering method using time gone concepts. Some experimental results are shown for various window queries and circular queries with different filtering combinations to show the performance tradeoffs of the proposed methods.

Range Estimation Algorithm Based on Triangulation Using Angle Measurements (각도 측정치를 이용한 삼각 측량법 기반 거리 추정 알고리즘)

  • Kang, Tae Young;Moon, Kyujin;Lee, Yong-Seon;Choi, Sung-Ho;Ryoo, Chang-Kyung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.48 no.4
    • /
    • pp.277-284
    • /
    • 2020
  • The remaining range between missile and target can be used to calculate the guidance command as well as to determine the explosion time of the warhead. Since the range, however, is not directly measured by on-board sensors of the missile, it is usually estimated by filter-based techniques using angle-only measurements. Conventional filter-based techniques are complex and require huge computation. In this paper, we propose a range estimation algorithm based on the geometrical triangulation principle for two points of missiles and a target. The proposed algorithm has a simple structure but the accuracy is largely dependent on the measurement errors. To improve the accuracy of estimation, Digital Fading Memory Filter (DFMF) is applied. The performance of the proposed algorithm is analyzed through numerical simulations.

Ground Moving Target Displacement Compensation and Performance Analysis in the DPCA Based SAR-GMTI System (DPCA 기법을 이용한 SAR-GMTI 시스템에서 지상 이동 표적 오차 보상 기법 및 성능 분석)

  • Jung, Jae-Hoon;Jung, Jung-Soo;Jung, Chul-Ho;Kwag, Young-Kil
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.20 no.11
    • /
    • pp.1138-1144
    • /
    • 2009
  • The velocity and acceleration of the ground moving target can cause the target position to be displaced and defocused in the SAR image. In this paper, the displacement compensation scheme is presented to correct the displaced position and defocused moving target image in the DPCA based SAR-GMTI system. The influence of the ground moving target due to the velocity and acceleration is analyzed in range and azimuth directions, and its compensation method is presented with the simulation results. The performance of the proposed method is compared with respect to the estimated velocity and defocused quantity in both range and azimuth directions.

Joint Range and Angle Estimation of FMCW MIMO Radar (FMCW MIMO 레이다를 이용한 거리-각도 동시 추정 기법)

  • Kim, Junghoon;Song, Sungchan;Chun, Joohwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.30 no.2
    • /
    • pp.169-172
    • /
    • 2019
  • Frequency-modulated continuous wave(FMCW) radars with array antennas are widely used because of their light weight and relatively high resolution. A usual approach for the joint range and angle estimation of a target using an array FMCW radar is to create a range-angle matrix with the deramped received signal, and subsequently apply two-dimensional(2D) frequency estimation methods such as 2D fast Fourier transform on the range-angle matrix. However, such frequency estimation approaches cause bias errors since the frequencies in the range-angle matrix are not independent. Therefore, we propose a new maximum likelihood-based algorithm for joint range and angle estimation of targets using array FMCW radar, and demonstrate that the proposed algorithm achieves the Cram?r-Rao bounds, both for range as well as angle estimation.

A hash-based matching scheme for shape-based image retrieval (외형 기반 이미지 검색을 위한 해시 기반 검색 기법)

  • Yoon-Sik Tak;Eenjun Hwang;Hong-Keun Choi
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.328-331
    • /
    • 2008
  • 많은 양의 이미지를 포함하고 있는 대용량 데이터베이스에 대한 이미지 검색에서 보다 짧은 시간에 적은 양의 검색공간을 사용하면서 원하는 결과를 얻을 수 있는 이미지 인덱싱 기법에 대한 다양한 연구가 진행되어 왔다. 본 논문에서는 외형 기반의 이미지 검색에서 기존의 인덱싱 기법보다 빠른 검색을 지원할 수 있는 해시 기반의 새로운 인덱싱 기법을 제안한다. 기존의 해시 기반 인덱싱 기법에서는 해시 주소 계산을 위해 인덱스 값의 범위가 미리 정해져야 하기 때문에 색상 정보 등 소수의 특징 정보를 제외하고는 인덱싱에 널리 사용되지 못하고 있다. 한편, 제안된 해시 구조는 값의 범위가 정해지지 않은 정수형의 인덱스 값을 기반으로 효과적으로 이미지 인덱스를 구축할 수 있다. 효과적인 이미지 검색을 위해 제안된 인덱스를 기반한 범위검색(Range Search) 기법을 제안하였으며, 실험을 통해 제안된 인덱스 구조에서의 범위 검색이 기존의 인덱스 구조에 비해 보다 효과적임을 보인다.