• Title/Summary/Keyword: Range processing

Search Result 2,741, Processing Time 0.033 seconds

Range Walk Compensated Squint Cross-Range Doppler Processing in Bistatic Radar (바이스태틱 레이더에서 Range Walk이 보상된 Squint Cross-Range 도플러 프로세싱)

  • Youn, Jae-Hyuk;Kim, Kwan-Soo;Yang, Hoon-Gee;Chung, Yong-Seek;Lee, Won-Woo;Bae, Kyung-Bin
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.11
    • /
    • pp.1141-1144
    • /
    • 2011
  • Range walk has been a major problem in achieving correct Doppler processing. This frequently occurs when range variation is severe just like in a bistatic radar or in high speed target scenario. This paper presents a range walk compensated range-Doppler processing algorithm applicable to the bistatic radar. In order for the compensation, a range-domain interpolation is applied for range compressed signal so that Doppler processing is performed along the evenly time-spaced range bins that contain target returns. Under a bistatic radar scenario, the proposed algorithm including a range domain pulse compression is mathematically described. Finally, the validity of the algorithm is demonstrated by simulation results showing the superiority of a SCDP(Squint Cross-range Doppler Processing) over an uncompensated Doppler processing.

The Role of Pitch Range Reset in Korean Sentence Processing

  • Kong, Eun-Jong
    • Phonetics and Speech Sciences
    • /
    • v.2 no.1
    • /
    • pp.33-39
    • /
    • 2010
  • This study investigates the effect of pitch range reset in Korean listeners' processing of syntactically ambiguous participle structures. Unlike Japanese and English,in Korean, the downtrend or the reset of pitch range does not consistently differentiate Accentual Phrases (AP), a lower level of phrasing, from Intonational Phrases (IP), a higher level of phrasing. Therefore, we explore Korean listeners' comprehension patterns for syntactically ambiguous speech strings varying in 1) the relative height of F0 peaks across prosodic units, and 2) the types of prosodic phrasing, to see whether pitch range reset informs the recovery of syntactic structure even though it is not reflected in the intonational hierarchy in Korean. The results show that the hierarchical level of prosodic phrasing affects the parsing pattern of syntactic ambiguity. The pitch range reset also cued the location of syntactic boundaries, but this effect was confined to phrases across AP.

  • PDF

Architecture of Signal Processing Unit to Improve Range and Velocity Error for Automotive FMCW Radar (FMCW 레이더의 거리 및 속도 오차 향상을 위한 신호처리부 하드웨어 구조 제안)

  • Hyun, Eu-Gin;Lee, Jong-Hun
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.18 no.4
    • /
    • pp.54-61
    • /
    • 2010
  • In this paper, we design the signal processing unit to effectively support the proposed algorithm for an automotive Frequency Modulation Continuous Wave(FMCW) radar. In the proposed method, we can obtain the distance and velocity with improved error depending on each range(long, middle, and short) of the target. Since a high computational capacity is required to obtain more accurate distance and velocity for target in near range, the proposed signal processing unit employs the time de-interleaving and the frequency interpolation method to overcome the limitation. Moreover, for real-time signal processing, the parallel architecture is used to extract simultaneously the distance and velocity in each range.

Profile Management System of Material Piles by Dynamic Range Finding (동적 Range 검출에 의한 원료 Pile 형상 관리 시스템)

  • 안현식
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.333-336
    • /
    • 2000
  • In this paper, a profile management system consisting of global and local range finders is presented for the automat ion of material pile handling. A global range finder detects range data of the front part of the piles of material and a profile map is obtained from a 3D profile detection algorithm. A local range finder attached on the side of the arm of the reclaimer detects range data with the handling function dynamically, and a local profile patch is acquired from the range data A yard profile map manager constructs a map by using the 3D profile of the global range finder and revises the map by replacing it with the local profile patch obtained Iron the local range finder. The developed vision system was applied to a simulator and the results of test show that it is appropriate to use for automating the material handling.

  • 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

Range Query Processing of Distributed Moving Object Databases using Scheduling Technique (스케쥴링 기법을 이용한 분산 이동 객체 데이타베이스의 범위 질의 처리)

  • Jeon, Se-Gil;Hwang, Jae-Il;Nah, Youn-Mook
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.2 s.12
    • /
    • pp.51-62
    • /
    • 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. The primary processing of LBS application is spatio-temporal range queries. To improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structures of GALIS architecture,which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

  • PDF

An Efficient Range Query Processing of Distributed Moving Object (분산 이동 객체 데이터베이스의 효율적인 범위 질의 처리)

  • Jeon, Se-Gil;Woo, Chan-Il
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.42 no.1
    • /
    • pp.35-40
    • /
    • 2005
  • Recently, the location based service for moving customers is becoming one of the most important service in mobile communication area and for moving object applications, there are lots of update operations and such update loads are concentrated on some particular area unevenly. The primary processing of LBS application is spatio-temporal range queries and to improve the throughput of spatio-temporal range queries, the time of disk I/O in query processing should be reduced. In this paper, we adopt non-uniform two-level grid index structure, which are designed to minimize update operations. We propose query scheduling technique using spatial relationship and time relationship and a combined spatio-temporal query processing method using time zone concepts to improve the throughput of query processing. Some experimental results are shown for range queries with different query range to show the performance tradeoffs of the proposed methods.

Power-Aware Query Processing Using Optimized Distributed R-tree in Sensor Networks (센서 네트워크 환경에서 최적화된 분산 R-tree를 이용한 에너지 인식 질의 처리 방법)

  • Pandey Suraj;Eo Sang-Hun;Kim Ho-Seok;Bae Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.13D no.1 s.104
    • /
    • pp.23-28
    • /
    • 2006
  • In this paper, a power-aware query processing using optimized distributed R-tree in a sensor network is proposed. The proposed technique is a new approach for processing range queries that uses spatial indexing. Range queries are most often encountered under sensor networks for computing aggregation values. The previous work just addressed the importance but didn't provide any efficient technique for processing range queries. A query processing scheme is thus designed for efficiently processing them. Each node in the sensor network has the MBR of the region where its children nodes and the node itself are located. The range query is evaluated over the region which intersects the geographic location of sensors. It ensures the maximum power savings by avoiding the communication of nodes not participating over the evaluation of the query.

A Method of Cross-Section Processing for the SHGC Description of a Range Image (거리영상의 SHGC 표현을 위한 단면 처리법)

  • 김태우;최병욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.190-198
    • /
    • 1994
  • In this paper, we propose the cross-section processing method which is simple in describing the SHGC of objects in a range image and which can describe the SHGC of occluded objects for the recognition of 3D objects. This method produces the cross-sections of an object along the assumed axis of the SHGC and describes the SHGC of the object by processing the produced cross-sections of the object using $\psi$ -S curves with invariant properties in position and size. Our method is simple in a process and can descirbe the SHGC of partially occluded objects because it uses range images with 3-D informations of objects without matching contours of objects with a model base. Thus it is a useful description method of a range image for the recognition of 3D objects shaped in SHGC form and we proved the usefulness of it in experiments.

  • PDF

A Study on Speed Improvement of Medical Image Reconstruction Using Limited Range Process (부분영역처리를 이용한 영상재구성의 속도개선에 관한 연구)

  • Ryu, Jong-Hyun;Beack, Seung-Hwa
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.5
    • /
    • pp.658-663
    • /
    • 1999
  • 2D sliced CT images hardly express the human disease in a space. This space expression can be reconstructed into 3D image by piling up the CT sliced image in succession. In medical image, in order to get the reconstructed 3D images, expensive system or much calculation time is needed. But by changing the method of reconstruction procedure and limit the range, the reconstruction time could be reduced. In this study, to reduce the processing time and memory, we suggested a method of interpolation and ray casting processing at the same time in a limited range. Such a limited range processing have advantages that we could reduce the unnecessary interpolation and ray casting. Through a experiment, it is founded that the reconstruction time and the memory was much reduced.

  • PDF