• Title/Summary/Keyword: Adaptive Search

Search Result 474, Processing Time 0.044 seconds

Analysis of MPEG-4 Encoder for Object-based Video (실시간 객체기반 비디오 서비스를 위한 MPEG-4 Encoder 분석)

  • Kim Min Hoon;Jang Euee Seon;Lee Sun young;Moon Seok ju
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.1
    • /
    • pp.13-20
    • /
    • 2004
  • In this paper, we have analyzed the current MPEG-4 video encoding tools and proposed efcient coding techniques that reduce the complexity of the encoder. Until recently, encoder optimization without shape coding has been a major concern in video for wire/wireless low bit rate coding services. Recently, we found out that the computational complexity of MPEG-4 shape coding plays a very important role in the object-based coding through experiments. We have made an experiment whether we could get optimized object-based coding method through successfully combining latest optimized texture coding techniques with our proposed optimized shape coding techniques. In texture coding, we applied the MVFAST method for motion estimation. We chose not to use IVOPF(Intelligent VOP Formation) but to use TRB(Tightest Rectangular Boundary) for positioning VOP and, finally, to eliminate the spiral search of shape motion estimation to reduce the complexity in shape coding. As a result of experiment, our proposed scheme achieved improved time complexity over the existing reference software by $57.3\%$ and over the optimized method on which only shape coding was applied by $48.7\%$, respectively.

Markerless Motion Capture Algorithm for Lizard Biomimetics (소형 도마뱀 운동 분석을 위한 마커리스 모션 캡쳐 알고리즘)

  • Kim, Chang Hoi;Kim, Tae Won;Shin, Ho Cheol;Lee, Heung Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.9
    • /
    • pp.136-143
    • /
    • 2013
  • In this paper, a algorithm to find joints of a small animal like a lizard from the multiple-view silhouette images is presented. The proposed algorithm is able to calculate the 3D coordinates so that the locomotion of the lizard is markerlessly reconstructed. The silhouette images of the lizard was obtained by a adaptive threshold algorithm. The skeleton image of the silhouette image was obtained by Zhang-Suen method. The back-bone line, head and tail point were detected with the A* search algorithm and the elimination of the ortho-diagonal connection algorithm. Shoulder joints and hip joints of a lizard were found by $3{\times}3$ masking of the thicked back-bone line. Foot points were obtained by morphology calculation. Finally elbow and knee joint were calculated by the ortho distance from the lines of foot points and shoulder/hip joint. The performance of the suggested algorithm was evaluated through the experiment of detecting joints of a small lizard.

Joint Optimization of the Motion Estimation Module and the Up/Down Scaler in Transcoders television (트랜스코더의 해상도 변환 모듈과 움직임 추정 모듈의 공동 최적화)

  • Han, Jong-Ki;Kwak, Sang-Min;Jun, Dong-San;Kim, Jae-Gon
    • Journal of Broadcast Engineering
    • /
    • v.10 no.3
    • /
    • pp.270-285
    • /
    • 2005
  • A joint design scheme is proposed to optimize the up/down scaler and the motion vector estimation module in the transcoder system. The proposed scheme first optimizes the resolution scaler for a fixed motion vector, and then a new motion vector is estimated for the fixed scaler. These two steps are iteratively repeated until they reach a local optimum solution. In the optimization of the scaler, we derive an adaptive version of a cubic convolution interpolator to enlarge or reduce digital images by arbitrary scaling factors. The adaptation is performed at each macroblock of an image. In order to estimate the optimal motion vector, a temporary motion vector is composed from the given motion vectors. Then the motion vector is refined over a narrow search range. It is well-known that this refinement scheme provides the comparable performance compared to the full search method. Simulation results show that a jointly optimized system based on the proposed algorithms outperforms the conventional systems. We can also see that the algorithms exhibit significant improvement in the minimization of information loss compared with other techniques.

A Link-Label Based Node-to-Link Optimal Path Algorithm Considering Non Additive Path Cost (비가산성 경로비용을 반영한 링크표지기반 Node-to-Link 최적경로탐색)

  • Lee, Mee Young;Nam, Doohee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.91-99
    • /
    • 2019
  • Existing node-to-node based optimal path searching is built on the assumption that all destination nodes can be arrived at from an origin node. However, the recent appearance of the adaptive path search algorithm has meant that the optimal path solution cannot be derived in node-to-node path search. In order to reflect transportation data at the links in real-time, the necessity of the node-to-link (or link-to-node; NL) problem is being recognized. This research assumes existence of a network with link-label and non-additive path costs as a solution to the node-to-link optimal path problem. At the intersections in which the link-label has a turn penalty, the network retains its shape. Non-additive path cost requires that M-similar paths be enumerated so that the ideal path can be ascertained. In this, the research proposes direction deletion and turn restriction so that regulation of the loop in the link-label entry-link-based network transformation method will ensure that an optimal solution is derived up until the final link. Using this method on a case study shows that the proposed method derives the optimal solution through learning. The research concludes by bringing to light the necessity of verification in large-scale networks.

Sensory Integration Interventions for Children with Autism Spectrum Disorder in Korea: A Systematic Review (국내 자폐스펙트럼장애 아동을 대상으로 제공되는 감각통합 중재방법: 체계적 고찰)

  • Park, Young-Ju
    • The Journal of Korean Academy of Sensory Integration
    • /
    • v.20 no.3
    • /
    • pp.48-59
    • /
    • 2022
  • Objective : This study was intended to systematically consider the sensory integration intervention methods offered in Korea for children with autism spectrum disorder and to provide an evidence base for the application of sensory integration interventions. Methods : The subjects of this study were published studies in a national journal for the last 10 years from January 2011 to December 2020. The databases used for the search were RISS and DBpia. The search terms were 'autism', 'autism spectrum', 'sensory integration', and 'intervention'. A total of 10 studies were used in the analysis, which were analyzed at the qualitative and methodological quality of the research evidence and the results were presented according to the PICO (Patient, Intervention, Comparison, Outcome). Results : In the research analysis, the quality level of the evidence was highest at level IV, followed by level II. The methodological quality of the evidence was the most common for 'Good' research, followed 'Fair'. The study subjects were children with autism spectrum disorder and their parents, and the experimental design had the highest frequency of single-subject studies. Interventions have the highest number of studies confirming adaptive behavior and sensory modulation, and the evaluation tools used to measure interventions have the highest frequency of sensory profiles and Canadian occupational performance measures (COPM). All 10 studies used in the analysis showed positive improvements and statistically significant effects on various outcome values from sensory integration interventions. Conclusion : In the recent clinical environment, sensory integration interventions have been continuously conducted in children with autism spectrum disorder. In future research, it is necessary to conduct research on various sensory integration intervention methods and the high quality of the evidence for the application of sensory integration interventions.

Enhanced Index Assignment for Beamforming with Limited-rate Imperfect Feedback (피드백 에러가 있는 빔포밍 시스템에서 개선된 인덱스 배치기법)

  • Park, Noe-Yoon;Kim, Young-Ju
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.5
    • /
    • pp.7-14
    • /
    • 2012
  • The quantized beamforming systems always need the channel state information, which must be quantized into a finite set of vectors (named codebook), and feedback only sends the index representing the desired vector. Thereby it minimized the impact of feedback errors, caused by feedback overhead and delay. In this regard, index assignment (IA) methods, an exhaustive-search and group-based schemes, have been presented for minimizes the performance degradation without additional feedback bits. In this paper, we proposed enhanced group-based IA method, which used the optimal codebook design with chordal distance, having the adaptive properties in application of the existing IA methods. When the number of transmit antennas is 4 and LTE codebook is used, Monte-Carlo simulations verify that the proposed scheme has a power advantage of 0.5~1dB to obtain the same bit error rate than methods without IA, and it has 0.1~0.2 dB better performance compared with the existing IA methods over same environment.

Ontology-Based Adaptive Information Providing System (온톨로지 기반 정보제공 시스템)

  • Sohn, Young-Tae;Rhee, Sang-Keun;Lee, Ji-Hye;Kim, Jae-Kwan;Han, Yo-Sub;Park, Myon-Woong
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.596-600
    • /
    • 2009
  • As the amount of available information increases rapidly, sometimes the efficient search method alone is not enough to obtain necessary information in timely manner. Therefore additional support is needed to share the burden of searching for and filtering information. In the area of ubiquitous computing, computer systems existing everywhere should be able to proactively provide information just in time. Resource matching is essential in order to develop a system searching and recommending information required for a user in a specific context. This paper describes the infrastructure and methodology of information providing including systematical organization representation, ontological resource demarcation, and resource matching in the environment of a research institute. A specific application was developed to illustrate the proposed approach.

  • PDF

An Adaptive AODV Algorithm for Considering Node Mobility (노드 이동성을 고려한 적응형 AODV 알고리즘)

  • Hong, Youn-Sik;Hong, Jun-Sik;Lim, Hwa-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.529-537
    • /
    • 2008
  • AODV routing protocol is intended for use by mobile' nodes in an ad-hoc network. In AODV nodes create routes on an on-demand basis. As the degree of node mobility becomes high, however, the number of the control packets, RREQ and RREP messages, have increased so rapidly. The unexpected increases in the number of the control packets cause the destination node to decrease the packet receiving rate and also to increase the overall energy consumption of such a network. In this paper, we propose a novel method of adaptively controlling the occurrences of such RREQ messages based on AIAD (additive increase additive decrease) under a consideration of the current network status. We have tested our proposed method with the conventional AODV and the method using timestamp based on the three performance metrics, i.e.. how long does node moves, node velocity, and node density, to compare their performance.

An image enhancement algorithm for detecting the license plate region using the image of the car personal recorder (차량 번호판 검출을 위한 자동차 개인 저장 장치 이미지 향상 알고리즘)

  • Yun, Jong-Ho;Choi, Myung-Ryul;Lee, Sang-Sun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.3
    • /
    • pp.1-8
    • /
    • 2016
  • We propose an adaptive histogram stretching algorithm for application to a car's personal recorder. The algorithm was used for pre-processing to detect the license plate region in an image from a personal recorder. The algorithm employs a Probability Density Function (PDF) and Cumulative Distribution Function (CDF) to analyze the distribution diagram of the images. These two functions are calculated using an image obtained by sampling at a certain pixel interval. The images were subjected to different levels of stretching, and experiments were done on the images to extract their characteristics. The results show that the proposed algorithm provides less deterioration than conventional algorithms. Moreover, contrast is enhanced according to the characteristics of the image. The algorithm could provide better performance than existing algorithms in applications for detecting search regions for license plates.

Drone Location Tracking with Circular Microphone Array by HMM (HMM에 의한 원형 마이크로폰 어레이 적용 드론 위치 추적)

  • Jeong, HyoungChan;Lim, WonHo;Guo, Junfeng;Ahmad, Isitiaq;Chang, KyungHi
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.5
    • /
    • pp.393-407
    • /
    • 2020
  • In order to reduce the threat by illegal unmanned aerial vehicles, a tracking system based on sound was implemented. There are three main points to the drone acoustic tracking method. First, it scans the space through variable beam formation to find a sound source and records the sound using a microphone array. Second, it classifies it into a hidden Markov model (HMM) to find out whether the sound source exists or not, and finally, the sound source is In the case of a drone, a sound source recorded and stored as a tracking reference signal based on an adaptive beam pattern is used. The simulation was performed in both the ideal condition without background noise and interference sound and the non-ideal condition with background noise and interference sound, and evaluated the tracking performance of illegal drones. The drone tracking system designed the criteria for determining the presence or absence of a drone according to the improvement of the search distance performance according to the microphone array performance and the degree of sound pattern matching, and reflected in the design of the speech reading circuit.