• Title/Summary/Keyword: Adaptive Search

Search Result 474, Processing Time 0.029 seconds

Developing a Low Power BWE Technique Based on the AMR Coder (AMR 기반 저 전력 인공 대역 확장 기술 개발)

  • Koo, Bon-Kang;Park, Hee-Wan;Ju, Yeon-Jae;Kang, Sang-Won
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.4
    • /
    • pp.190-196
    • /
    • 2011
  • Bandwidth extension is a technique to improve speech quality and intelligibility, extending from 300-3400 Hz narrowband speech to 50-7000 Hz wideband speech. This paper designs an artificial bandwidth extension (ABE) module embedded in the AMR (adaptive multi-rate) decoder, reducing LPC/LSP analysis and algorithm delay of the ABE module. We also introduce a fast search codebook mapping method for ABE, and design a low power BWE technique based on the AMR decoder. The proposed ABE method reduces the computational complexity and the algorithm delay, respectively, by 28 % and 20 msec, compared to the traditional DTE (decode then extend) method. We also introduce a weighted classified codebook mapping method for constructing the spectral envelope of the wideband speech signal.

Real-Time Human Tracking Using Skin Area and Modified Multi-CAMShift Algorithm (피부색과 변형된 다중 CAMShift 알고리즘을 이용한 실시간 휴먼 트래킹)

  • Min, Jae-Hong;Kim, In-Gyu;Baek, Joong-Hwan
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.6
    • /
    • pp.1132-1137
    • /
    • 2011
  • In this paper, we propose Modified Multi CAMShift Algorithm(Modified Multi Continuously Adaptive Mean Shift Algorithm) that extracts skin color area and tracks several human body parts for real-time human tracking system. Skin color area is extracted by filtering input image in predefined RGB value range. These areas are initial search windows of hands and face for tracking. Gaussian background model prevents search window expending because it restricts skin color area. Also when occluding between these areas, we give more weights in occlusion area and move mass center of target area in color probability distribution image. As result, the proposed algorithm performs better than the original CAMShift approach in multiple object tracking and even when occluding of objects with similar colors.

Ontology Construction of Technological Knowledge for R&D Trend Analysis (연구 개발 트렌드 분석을 위한 기술 지식 온톨로지 구축)

  • Hwang, Mi-Nyeong;Lee, Seungwoo;Cho, Minhee;Kim, Soon Young;Choi, Sung-Pil;Jung, Hanmin
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.12
    • /
    • pp.35-45
    • /
    • 2012
  • Researchers and scientists spend huge amount of time in analyzing the previous studies and their results. In order to timely take the advantageous position, they usually analyze various resources such as paper, patents, and Web documents on recent research issues to preoccupy newly emerging technologies. However, it is difficult to select invest-worthy research fields out of huge corpus by using the traditional information search based on keywords and bibliographic information. In this paper, we propose a method for efficient creation, storage, and utilization of semantically relevant information among technologies, products and research agents extracted from 'big data' by using text mining. In order to implement the proposed method, we designed an ontology that creates technological knowledge for semantic web environment based on the relationships extracted by text mining techniques. The ontology was utilized for InSciTe Adaptive, a R&D trends analysis and forecast service which supports the search for the relevant technological knowledge.

Adaptive User Selection in Downlink Multi-User MIMO Networks (다중 사용자 및 다중 안테나 하향링크 네트워크에서 적응적 사용자 선택 기법)

  • Ban, Tae-Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.7
    • /
    • pp.1597-1601
    • /
    • 2013
  • Multiple antenna technique is attracting attention as a core technology for next-generation mobile communication systems to accommodate explosively increasing mobile data traffic. Especially, recent researches focus on multi-user multiple input multiple output (MU-MIMO) system where base stations are equipped with several tens of transmit antennas and transmit data to multiple terminals (users) simultaneously. To enhance the performance of MU-MIMO systems, we, in this paper, propose an adaptive user selection algorithm which adaptively selects a user set according to varying channel states. According to Monte-Carlo based computer simulations, the performance of proposed scheme is significantly improved compared to the conventional scheme without user selection and approaches that of exhaustive search-based optimal scheme. On the other hand, the proposed scheme can reduce the computational complexity to $K/(2^K-1)$ compared to the optimal scheme where K denotes the number of total users.

An Efficient Adaptive Bitmap-based Selective Tuning Scheme for Spatial Queries in Broadcast Environments

  • Song, Doo-Hee;Park, Kwang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.10
    • /
    • pp.1862-1878
    • /
    • 2011
  • With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

The Performance Modeling of a Low Bypass Turbofan Engine with Afterburner for Supersonic Aircraft (후기연소기가 장착된 초음속 항공기용 저바이패스 터보팬 엔진 성능 모델링)

  • Choi, Won;Lee, Il-Woo;Yang, Jun-Ho
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.39 no.3
    • /
    • pp.269-278
    • /
    • 2011
  • The details of engine manufacturer's engine simulations are generally kept secret and only those parameters that are used for control purposes are accessible to users. Hence, there is often only a limited amount of data accessible for creating a performance model of the engine. The performance modeling of a low bypass turbofan engine for supersonic aircraft is described herein. The Pratt and Whitney F100-PW-229 engine has been employed for low bypass turbofan engine performance modeling. Published data from the open literature are used as initial data for building the F100-PW-229 engine performance model. The unknown components' characteristics were estimated by optimization of parameters using by adaptive random search method and sensitivity analysis with respect to design variables. The engine performance model was evaluated to be properly constructed through the comparison of result of engine performance analysis and engine deck data.

GRASP Algorithm for Dynamic Weapon-Target Assignment Problem (동적 무장할당 문제에서의 GRASP 알고리즘 연구)

  • Park, Kuk-Kwon;Kang, Tae Young;Ryoo, Chang-Kyung;Jung, YoungRan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.12
    • /
    • pp.856-864
    • /
    • 2019
  • The weapon-target assignment (WTA) problem is a matter of effectively allocating weapons to a number of threats. The WTA in a rapidly changing dynamic environment of engagement must take into account both of properties of the threat and the weapon and the effect of the previous decision. We propose a method of applying the Greedy Randomized Adaptive Search Procedure (GRASP) algorithm, a kind of meta-heuristic method, to derive optimal solution for a dynamic WTA problem. Firstly, we define a dynamic WTA problem and formulate a mathematical model for applying the algorithm. For the purpose of the assignment strategy, the objective function is defined and time-varying constraints are considered. The dynamic WTA problem is then solved by applying the GRASP algorithm. The optimal solution characteristics of the formalized dynamic WTA problem are analyzed through the simulation, and the algorithm performance is verified via the Monte-Carlo simulation.

A Study on Types of Coping in School-Age Children : A Q-methodological Approach (학령기 아동의 대응 유형에 관한 연구 : Q방법론적 접근)

  • Jung Yun;Cho Kyoul Ja
    • Child Health Nursing Research
    • /
    • v.4 no.1
    • /
    • pp.116-127
    • /
    • 1998
  • The purpose of this study was to examine the reliability of Q-sorting and to develope a typology of coping to stress in school-age children through the use of Q-methodology. For the study, Q-statements are selected from the literature and interviews of 30 Children, A total number 153 statement were collected and 31 Q-samples were finally selected. AP-sample of 76 was selected the elementary school children. Each of respondents were given 31 coping strategies questionnaire and set of 31 statements with cartoon on each of cards and sorted them according to the 9-point scale. The result of the C-sorting by each subject were coded and analyzed using the QUANAL PC and SPSS PC+ program. As a result of the analysis, There were significant relationship between score each item of question naire and score of sorted statement. Therefore, school-age children was able to Q-sorting(forced normal distribution). Also, the four types of coping were named as follows : Type I (n=35) : To search for the dynamic behaviors Type II (n=12) : To search for the intellectual behaviors Type III (n=22) : To search for emotional-spiritual behaviors Type IV (n=7) : To search for the self-abuse behaviors Throught the study, the implication for teachers, parents and school nurses is that there is needed to guide and to support adaptive coping behaviors. Also, it is recommended that the application of Q-methodology for study of children's subjective concepts like stress and coping.

  • PDF

A Prediction Search Algorithm in Video Coding by using Neighboring-Block Motion Vectors (비디오 코딩을 위한 인접블록 움직임 벡터를 이용한 예측 탐색 알고리즘)

  • Kwak, Sung-Keun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.8
    • /
    • pp.3697-3705
    • /
    • 2011
  • There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose a new prediction search algorithm for block matching using the temporal and spatial correlation of the video sequence and local statistics of neighboring motion vectors. The proposed ANBA(Adaptive Neighboring-Block Search Algorithm) determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and use a previous motion vector. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 1.06dB as depend on the video sequences and improved about 0.01~0.64dB over MVFAST and PMVFAST.

An Efficient Mode Decision and Search Region Restriction for Fast Encoding of H.264/AVC (H.264/AVC의 빠른 부호화를 위한 효율적인 모드 결정과 탐색영역 제한)

  • Chun, Sung-Hwan;Shin, Kwang-Mu;Kang, Jin-Mi;Chung, Ki-Dong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.2
    • /
    • pp.185-195
    • /
    • 2010
  • In this paper, we propose an efficient inter and intra prediction algorithms for fast encoding of H.264/AVC. First, inter prediction mode decision method decides early using temporal/spatial correlation information and pixel direction information. Second, intra prediction mode decision method selects block size judging smoothness degree with inner/outer pixel value variation and decides prediction mode using representative pixel and reference pixel. Lastly, adaptive motion search region restriction sets search region using mode information of neighboring block and predicted motion vector. The experimental results show that proposed method can achieve about 18~53% reduction compared with the existing JM 14.1 in the encoding time. In RD performance, the proposed method does not cause significant PSNR value losses while increasing bitrates slightly.