• Title/Summary/Keyword: adaptive algorithm

Search Result 4,661, Processing Time 0.042 seconds

The Ship Detection Using Airborne and In-situ Measurements Based on Hyperspectral Remote Sensing (초분광 원격탐사 기반 항공관측 및 현장자료를 활용한 선박탐지)

  • Park, Jae-Jin;Oh, Sangwoo;Park, Kyung-Ae;Foucher, Pierre-Yves;Jang, Jae-Cheol;Lee, Moonjin;Kim, Tae-Sung;Kang, Won-Soo
    • Journal of the Korean earth science society
    • /
    • v.38 no.7
    • /
    • pp.535-545
    • /
    • 2017
  • Maritime accidents around the Korean Peninsula are increasing, and the ship detection research using remote sensing data is consequently becoming increasingly important. This study presented a new ship detection algorithm using hyperspectral images that provide the spectral information of several hundred channels in the ship detection field, which depends on high resolution optical imagery. We applied a spectral matching algorithm between the reflection spectrum of the ship deck obtained from two field observations and the ship and seawater spectrum of the hyperspectral sensor of an airborne visible/infrared imaging spectrometer. A total of five detection algorithms were used, namely spectral distance similarity (SDS), spectral correlation similarity (SCS), spectral similarity value (SSV), spectral angle mapper (SAM), and spectral information divergence (SID). SDS showed an error in the detection of seawater inside the ship, and SAM showed a clear classification result with a difference between ship and seawater of approximately 1.8 times. Additionally, the present study classified the vessels included in hyperspectral images by presenting the adaptive thresholds of each technique. As a result, SAM and SID showed superior ship detection abilities compared to those of other detection algorithms.

Channel Variation Tracking based Effective Preferred BS Selection Scheme of Idle Mode Mobile device for Mobile WiMAX System (Mobile WiMAX시스템에서 채널품질 변동추적을 이용한 유휴모드 이동단말의 효율적인 선호기지국 선택 방안)

  • Lee, Kang-Gyu;Youn, Hee-Yong
    • The KIPS Transactions:PartC
    • /
    • v.17C no.6
    • /
    • pp.471-484
    • /
    • 2010
  • In the wireless communication systems, the power consumption of a mobile device is very important issue due to its battery limitations. Hence most of the standards for wireless networks including a mobile WiMAX system are supporting their own power saving mode in way that a mobile device is able to reduce its energy usage while in the mode. However, those standards just define the arrangement of special time intervals, called a paging listening interval, during which the device needs to receive the paging-related control messages, and they do not specify how to effectively reduce the power in many different network environments. This means the amount of power spent by the device is very dependent on the implementations of individual device-vendors, and undesirable paging loss may happen according to the channel conditions. To reduce unnecessary power usage and the risk of paging loss, this paper proposes the effective frequency/BS selection algorithm applicable to a mobile device operating in the power saving mode, which serves the device with better BS based on the tracking for channel variation. This algorithm consists of the channel estimation phase during each paging listening interval, the tracking phase for the measured results, the frequency reselection phase based on the tracking activity, and the preferred BS reselection phase. Thus the proposed method can improve the paging performance while the device is moving in the network. Also the simulation result shows that the presented scheme is superior to other candidates in energy efficiency due to the channel-adaptive frequency/BS selection.

ea­-RED++: Adding Prediction Algorithm for ea­-RED Router Buffer Management Algorithm (ea-­RED++ : 예측 알고리즘을 적용한 ea-­RED 알고리즘)

  • Lee, Jong-Hyun;Lim, Hye-Young;Hwang, Jun;Kim, Young-Chan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.298-300
    • /
    • 2003
  • ea­RED(Efficient Adaptive RED)[1][2]는 다수의 TCP 커넥션이 경쟁하는 병목구간에서 인터넷 라우터 버퍼를 능동적으로 관리하는 다양한 AQM(Active Queue Management) 알고리즘 중의 하나로 RED 라우터 버퍼 관리 알고리즘의 성능을 개선한 라우터 버퍼 관리 알고리즘이다. RED 라우터가 TD 라우터와 같은 네트워크 퍼포먼스를 유지하면서 TCP 커넥션 간 페어니스를 향상시키기 위해서는 link bandwidth. active 커넥션 수. congestion level 등에 대한 네트워크 상태를 고려하여 파라미터에 적절한 값을 설정해야만 한다. 문제는 다이내믹하게 변하는 네트워크 상황에 적합한 파라미터 값을 초기에 설정해주는 것이 매우 어렵다는 점이다. [3]. ea­RED는 max threshold와 min threshold 값을 네트워크 상황에 따라 동적으로 조절함으로써 이런 문제를 해결했고, 기존 RED에 비해 라우터 버퍼는 50% 정도만 사용하면서도, 페어니스 인덱스(Fairness Index)[4]가 최대 41.42% 개선되었다. [1] [2] 그러나 송신 TCP 커넥션의 수가 늘어날수록 성능향상에 대한 효과가 감소되었고, 드롭 패킷수가 TD나 RED 라우터 버퍼관리 알고리즘에 비해 많았기 때문에 라우터의 출력(output) 총 패킷 용량이 최대 약 2.3% 정도 TD나 RED 라우터 버퍼관리 알고리즘에 비해 적었다. 이 부분을 개선하기 위해 기존 ea­RED 알고리즘에 LR_Lines 예측 알고리즘을 적용한 ea­RED++ 알고리즘을 구현하였고, 실험 결과 페어니스 인덱스는 기존 ea­RED에 비해 최대 약 30% 정도 향상되었고, 총 output 패킷 용량의 손실률은 최대 50%정도 감소하여 기존 ea­RED에 비해 향상된 성능을 보여주었다.웍스 네트워크상의 다양한 디바이스들간의 네트워크 다양화와 분산화 기능을 얻을 수 있었고, 기존의 고가의 해외 솔루션인 Echelon사의 LonMaker 소프트웨어를 사용하지 않고도 국내의 순수 솔루션인 리눅스 기반의 LonWare 3.0 다중 바인딩 기능을 통해 저 비용으로 홈 네트워크 구성 관리 서버 시스템 개발에 대한 비용을 줄일 수 있다. 기대된다.e 함량이 대체로 높게 나타났다. 점미가 수가용성분에서 goucose대비 용출함량이 고르게 나타나는 경향을 보였고 흑미는 알칼리가용분에서 glucose가 상당량(0.68%) 포함되고 있음을 보여주었고 arabinose(0.68%), xylose(0.05%)도 다른 종류에 비해서 다량 함유한 것으로 나타났다. 흑미는 총식이섬유 함량이 높고 pectic substances, hemicellulose, uronic acid 함량이 높아서 콜레스테롤 저하 등의 효과가 기대되며 고섬유식품으로서 조리 특성 연구가 필요한 것으로 사료된다.리하였다. 얻어진 소견(所見)은 다음과 같았다. 1. 모년령(母年齡), 임신회수(姙娠回數), 임신기간(姙娠其間), 출산시체중등(出産時體重等)의 제요인(諸要因)은 주산기사망(周産基死亡)에 대(對)하여 통계적(統計的)으로 유의(有意)한 영향을 미치고 있어 $25{\sim}29$세(歲)의 연령군에서, 2번째 임신과 2번째의 출산에서 그리고 만삭의 임신 기간에, 출산시체중(出産時體重) $3.50{\sim}3.99kg$사이의 아이에서 그 주산기사망률(周産基死亡率)이 각각 가장 낮았다. 2. 사산(死産)과 초생아사망(初生兒死亡)을 구분(區分)하여 고려해 볼때 사산(死産)은 모성(母性)의 임신력(姙娠歷)과 매우 밀접한 관련이 있는 것으로 사료(思料)되었고 초생아사망(初生兒死亡)은 미숙아(未熟兒)와 이에 관련된 병

  • PDF

Adaptive Image Content-Based Retrieval Techniques for Multiple Queries (다중 질의를 위한 적응적 영상 내용 기반 검색 기법)

  • Hong Jong-Sun;Kang Dae-Seong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.3 s.303
    • /
    • pp.73-80
    • /
    • 2005
  • Recently there have been many efforts to support searching and browsing based on the visual content of image and multimedia data. Most existing approaches to content-based image retrieval rely on query by example or user based low-level features such as color, shape, texture. But these methods of query are not easy to use and restrict. In this paper we propose a method for automatic color object extraction and labelling to support multiple queries of content-based image retrieval system. These approaches simplify the regions within images using single colorizing algorithm and extract color object using proposed Color and Spatial based Binary tree map(CSB tree map). And by searching over a large of number of processed regions, a index for the database is created by using proposed labelling method. This allows very fast indexing of the image by color contents of the images and spatial attributes. Futhermore, information about the labelled regions, such as the color set, size, and location, enables variable multiple queries that combine both color content and spatial relationships of regions. We proved our proposed system to be high performance through experiment comparable with another algorithm using 'Washington' image database.

A New Resource Allocation with Rate Proportionality Constraints in OFDMA Systems (OFDMA 시스템에서 비율적 전송률 분배를 위한 자원 할당)

  • Han, Seung-Youp;Oh, Eun-Sung;Han, Myeong-Su;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.1
    • /
    • pp.59-65
    • /
    • 2008
  • In this paper, a new adaptive resource allocation scheme is proposed in orthogonal frequency-division multiple access(OFDMA) systems with rate proportionality constraints. The problem of maximizing the overall system capacity with constraints on bit error rate, total transmission power and rate-proportionality for user requiring different classes of service is formulated. Since the optimal solution to the constrained fairness problem is extremely complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. Firstly, the number of subchannels to be assigned to each user is determined based on the users' average signal-to-noise ratio and rate-proportion. Subchannels are subsequently distributed according to the modified max-min criterion. Lastly, based on the subchannel allocation, the optimal power allocation by solving the Language dual problem is proposed. Additionally, in order to reduce the computational complexity, iterative rate proportionality tracking algorithm is proposed for maximizing the capacity together with maintaining the rate proportionality constraint.

On the Development of Agent-Based Online Game Characters (에이전트 기반 지능형 게임 캐릭터 구현에 관한 연구)

  • 이재호;박인준
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.11a
    • /
    • pp.379-384
    • /
    • 2002
  • 개발적인 측면에서 온라인 게임 환경에서의 NPC(Non Playable Character)들은 환경인식능력, 이동능력, 특수 능력 및 아이템의 소유 배분 등을 원활히 하기 위한 능력들을 소유해야 하며, 게임 환경을 인식, 저장하기 위한 데이터구조와 자신만의 독특한 임무(mission)를 달성하기 위한 계획을 갖고 행위를 해야 한다. 이런 의미에서 NPC는 자신만의 고유한 규칙과 행동 패턴, 그리고 목표(Goal)와 이를 실행하기 위한 계획(plan)을 소유하는 에이전트로 인식되어야 할 것이다. 그러나, 기존 게임의 NPC 제어 구조나 구현 방법은 이러한 요구조건에 부합되지 못한 부분이 많았다. C/C++ 같은 컴퓨터 언어들을 이용한 구현은 NPC의 유연성이나, 행위에 많은 문제점이 있었다. 이들 언어의 switch 문법은 NPC의 몇몇 특정 상태를 묘사하고, 그에 대한 행위를 지정하는 방법으로 사용되었으나, 게임 환경이 복잡해지면서, 더욱더 방대한 코드를 만들어야 했고, 해석하는데 많은 어려움을 주었으며, 동일한 NPC에 다른 행동패턴을 적용시키기도 어려웠다. 또한, 대부분의 제어권을 게임 서버 폭에서 도맡아 함으로써, 서버측에 많은 과부하 요인이 되기도 하였다. 이러한 어려움을 제거하기 위해서 게임 스크립트를 사용하기도 하였지만, 그 또한 단순 반복적인 패턴에 사용되거나, 캐릭터의 속성적인 측면만을 기술 할 수 있을 뿐이었다 이러한 어려움을 해소하기 위해서는 NPC들의 작업에 필요한 지식의 계층적 분화를 해야 하고, 현재 상황과 목표 변화에 적합한 반응을 표현할 수 있는 스크립트의 개발이 필수 적이라 할 수 있다 또한 스크립트의 실행도 게임 서버 측이 아닌 클라이언트 측에서 수행됨으로써, 서버에 걸리는 많은 부하를 줄일 수 있어야 할 것이다. 본 논문에서는, 대표적인 반응형 에이전트 시스템인 UMPRS/JAM을 이용하여, 에이전트 기반의 게임 캐릭터 구현 방법론에 대해 알아본다.퓨터 부품조립을 사용해서 Template-based reasoning 예를 보인다 본 방법론은 검색노력을 줄이고, 검색에 있어 Feasibility와 Admissibility를 보장한다.매김할 수 있는 중요한 계기가 될 것이다.재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having

  • PDF

A Dynamic Orchestration Framework for Supporting Sustainable Services in IT Ecosystem (IT 생태계의 지속적인 운영을 위한 동적 오케스트레이션 프레임워크)

  • Park, Soo Jin
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.12
    • /
    • pp.549-564
    • /
    • 2017
  • Not only services that are provided by a single system have been various with the development of the Internet of Things and autonomous software but also new services that are not possible before are provided through collaboration between systems. The collaboration between autonomous systems is similar to the ecosystem configuration in terms of biological viewpoints. Thus, it is called the IT Ecosystem, and this concept has arisen newly in recent years. The IT Ecosystem refers to a concept that achieves a mission of each of a number of heterogeneous systems rather than a single system utilizing their own autonomy as well as achieving the objectives of the overall system simultaneously in order to meet a single common goal. In our previous study, we proposed architecture of elementary level and as well as basic several meta-models to implement the IT Ecosystem. This paper proposes comprehensive reference architecture framework to implement the IT Ecosystem by cleansing the previous study. Among them, a utility function based on cost-benefit model is proposed to solve the dynamic re-configuration problem of system components. Furthermore, a measure of using genetic algorithm is proposed as a solution to reduce the dynamic re-configuration overhead that is increased exponentially according to the expansion of the number of entities of components in the IT Ecosystem. Finally, the utilization of the proposed orchestration framework is verified quantitatively through probable case studies on IT Ecosystem for unmanned forestry management.

A Study on the Implementation of an Agile SFFS Based on 5DOF Manipulator (5축 매니퓰레이터를 이용한 쾌속 임의형상제작시스템의 구현에 관한 연구)

  • Kim Seung-Woo;Jung Yong-Rae
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.42 no.1
    • /
    • pp.1-11
    • /
    • 2005
  • Several Solid Freeform Fabrication Systems(SFFS) are commercialized in a few companies for rapid prototyping. However, they have many technical problems including the limitation of applicable materials. A new method of agile prototyping is required for the recent manufacturing environments of multi-item and small quantity production. The objectives of this paper include the development of a novel method of SFFS, the CAFL/sup VM/(Computer Aided Fabrication of Lamination for Various Material), and the manufacture of the various material samples for the certification of the proposed system and the creation of new application areas. For these objectives, the technologies for a highly accurate robot path control, the optimization of support structure, CAD modeling, adaptive slicing was implemented. However, there is an important problem with the conventional 2D lamination method. That is the inaccuracy of 3D model surface, which is caused by the stair-type surface generated in virtue of vertical 2D cutting. In this paper, We design the new control algorithm that guarantees the constant speed, precise positioning and tangential cutting on the 5DOF SFFS. We develop the tangential cutting algorithm to be controlled with constant speed and successfully implemented in the 5DOF CAFL/sup VM/ system developed in this paper. Finally, this paper confirms its high-performance through the experimental results from the application into CAFL/sup VM/ system.

Hardware optimized high quality image signal processor for single-chip CMOS Image Sensor (Single-chip CMOS Image Sensor를 위한 하드웨어 최적화된 고화질 Image Signal Processor 설계)

  • Lee, Won-Jae;Jung, Yun-Ho;Lee, Seong-Joo;Kim, Jae-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.5
    • /
    • pp.103-111
    • /
    • 2007
  • In this paper, we propose a VLSI architecture of hardware optimized high quality image signal processor for a Single-chip CMOS Image Sensor(CIS). The Single-chip CIS is usually used for mobile applications, so it has to be implemented as small as possible while maintaining the image quality. Several image processing algorithms are used in ISP to improve captured image quality. Among the several image processing blocks, demosaicing and image filter are the core blocks in ISP. These blocks need line memories, but the number of line memories is limited in a low cost Single-chip CIS. In our design, high quality edge-adaptive and cross channel correlation considered demosaicing algorithm is adopted. To minimize the number of required line memories for image filter, we share the line memories using the characteristics of demosaicing algorithm which consider the cross correlation. Based on the proposed method, we can achieve both high quality and low hardware complexity with a small number of line memories. The proposed method was implemented and verified successfully using verilog HDL and FPGA. It was synthesized to gate-level circuits using 0.25um CMOS standard cell library. The total logic gate count is 37K, and seven and half line memories are used.

Real-Time DSP Implementation of IMT-2000 Speech Coding Algorithm (IMT-2000 음성부호화 알고리즘의 실시간 DSP 구현)

  • Seo, Jeong-Uk;Gwon, Hong-Seok;Park, Man-Ho;Bae, Geon-Seong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.3
    • /
    • pp.304-315
    • /
    • 2001
  • In this paper, we peformed the real-time implementation of AMR(Adaptive Multi-Rate) speech coding algorithm which is adopted for IMT-2000 service using TMS320C6201, i.e., a Texas Instrument´s fixed-point DSP. With the ANSI C source code released from ETSI, optimization is performed to make it run in real-time with memory as small as possible using the C compiler and assembly language. Implemented AMR speech codec has the size of 32.06 kWords program memory, 9.75 kWords data RAM memory, and 19.89 kWords data ROM memory. And, The time required for processing one frame of 20 ms length speech data is about 4.38 ms, and it is short enough for real-time operation. It is verified that the decoded result of the implemented speech codec on the DSP is identical with the PC simulation result using ANSI C code for test sequences. Also, actual sound input/output test using microphone and speaker demonstrates its proper real-time operation without distortions or delays.

  • PDF