• Title/Summary/Keyword: Linear Complexity

Search Result 683, Processing Time 0.025 seconds

Research on improvement of target tracking performance of LM-IPDAF through improvement of clutter density estimation method (클러터밀도 추정 방법 개선을 통한 LM-IPDAF의 표적 추적 성능 향상 연구)

  • Yoo, In-Je;Park, Sung-Jae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.5
    • /
    • pp.99-110
    • /
    • 2017
  • Improving tracking performance by estimating the status of multiple targets using radar is important. In a clutter environment, a joint event occurs between the track and measurement in multiple target tracking using a tracking filter. As the number increases, the joint event increases exponentially. The problem to be considered when multiple target tracking filter design in such environments is that first, the tracking filter minimizes the rate of false track alarmsby eliminating the false track and quickly confirming the target track. The purpose is to increase the FTD performance. The second consideration is to improve the track maintenance performance by allocating each measurement to a track efficiently when an event occurs. Through two considerations, a single target tracking data association technique is extended to a multiple target tracking filter, and representative algorithms are JIPDAF and LM-IPDAF. In this study, a probabilistic evaluation of many hypotheses in the assignment of measurements was not performed, so that the computation amount does not increase nonlinearly according to the number of measurements and tracks, and the track existence probability based on the track density The LM-IPDAF algorithm was introduced. This paper also proposes a method to reduce the computational complexity by improving the clutter density estimation method for calculating the track existence probability of LM-IPDAF. The performance was verified by a comparison with the existing algorithm through simulation. As a result, it was possible to reduce the simulation processing time by approximately 20% while achieving equivalent performance on the position RMSE and Confirmed True Track.

The Effects of Acupuncture on the Electroencephalogram of Patients with Stroke (자침이 중풍환자의 뇌파 변화에 미치는 영향)

  • Yoon, Ga-Young;Park, Ji-Min;Kim, Dong-Hyuk;Seon, Jong-In;Kang, Jung-Won;Nam, Dong-Woo;Lee, Seung-Deok;Choi, Do-Young;Lee, Jae-Dong
    • Journal of Acupuncture Research
    • /
    • v.29 no.5
    • /
    • pp.1-16
    • /
    • 2012
  • Objectives : The purpose of this study was to examine the effects of manual acupuncture at the $LI_4$, $ST_{36}$ and $LR_3$ on Electroencephalogram(EEG) of patients with stroke. Methods : 32 channel EEG measurement was carried out in 35 Stroke patients(23 males and 12 females). EEG was measured for 21 minutes(made up of 7 sessions, 1 session means 3 minutes time interval) including 15 minutes(5 sessions) of acupuncture time. Power spectrum analysis was used as a measure of complexity. Statistical analysis was performed using Linear mixed model and DUNNETT's multiple comparison. Results : The results were as follows; 1. EEG amplitude was reduced during acupuncture except electrodes PG1 and PG2. 2. There was a notable change during 6~9 minutes after needling in ${\delta}{\cdot}{\beta}{\cdot}{\gamma}$ wave, and during 6~9 minutes after needling in ${\Theta}{\cdot}{\alpha}$ wave. Overall, during 6~9 minutes after needling. 3. TP8 is a common significant electrode among five wave forms. Conclusions : These results suggest that TP8 could be typical electrodes and change of EEG compared to baseline happens most often during 6~9 minutes after manipulated acupuncture at the $LI_4$, $ST_{36}$ and $LR_3$ of patients with stroke.

A New Endpoint Detection Method Based on Chaotic System Features for Digital Isolated Word Recognition System (음성인식을 위한 혼돈시스템 특성기반의 종단탐색 기법)

  • Zang, Xian;Chong, Kil-To
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.46 no.5
    • /
    • pp.8-14
    • /
    • 2009
  • In the research field of speech recognition, pinpointing the endpoints of speech utterance even with the presence of background noise is of great importance. These noise present during recording introduce disturbances which complicates matters since what we just want is to get the stationary parameters corresponding to each speech section. One major cause of error in automatic recognition of isolated words is the inaccurate detection of the beginning and end boundaries of the test and reference templates, thus the necessity to find an effective method in removing the unnecessary regions of a speech signal. The conventional methods for speech endpoint detection are based on two linear time-domain measurements: the short-time energy, and short-time zero-crossing rate. They perform well for clean speech but their precision is not guaranteed if there is noise present, since the high energy and zero-crossing rate of the noise is mistaken as a part of the speech uttered. This paper proposes a novel approach in finding an apparent threshold between noise and speech based on Lyapunov Exponents (LEs). This proposed method adopts the nonlinear features to analyze the chaos characteristics of the speech signal instead of depending on the unreliable factor-energy. The excellent performance of this approach compared with the conventional methods lies in the fact that it detects the endpoints as a nonlinearity of speech signal, which we believe is an important characteristic and has been neglected by the conventional methods. The proposed method extracts the features based only on the time-domain waveform of the speech signal illustrating its low complexity. Simulations done showed the effective performance of the Proposed method in a noisy environment with an average recognition rate of up 92.85% for unspecified person.

A Study on the Improved Parity Check Receiver for the Extended m-sequence Based Multi-code Spread Spectrum System with Code Set Partitioning and Constant Amplitude Precoding (코드집합 분할 방식의 확장 m-시퀀스 기반 정진폭 멀티코드 대역확산 통신 시스템을 위한 개선된 패리티 검사 기반 수신기에 관한 연구)

  • Han, Jun-Sang;Kim, Dong-Joo;Kim, Myoung-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.8
    • /
    • pp.1-11
    • /
    • 2012
  • The multi-code spread spectrum communication system, which spreads data bit stream by multiplexing orthogonal codes, can transmit data in high rate. However it needs the high-cost good linear amplifier because of the multi-level output signal. In order to overcome this drawback several systems making the amplitude of output signal constant with Walsh codes have been proposed. Recently constant amplitude pre-coded multi-code spread spectrum systems using extended m-sequence have been proposed. In this paper we consider an extended m-sequence based constant amplitude multi-code spread spectrum system with code set partitioning. By grouping the orthogonal codes into 4 subsets, not only is the computational complexity of the transceiver reduced but BER performance also improves. It has been shown that parity checking on four detected codes at the receiver can correct code detection error and result in BER performance enhancement. In this paper we propose a improved parity check receiver. We carried out computer simulation to verify feasibility of the proposed algorithm.

A Candidate Codec Algorithm on Superwideband Extension to ITU-T G.711.1 and G.722 (ITU-T G.711.1 및 G.722 슈퍼와이드밴드 확장 후보 코덱 알고리즘)

  • Sung, Jong-Mo;Kim, Hyun-Woo;Kim, Do-Young;Lee, Byung-Sun;Ko, Yun-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.5
    • /
    • pp.62-73
    • /
    • 2010
  • In this paper we proposed a candidate algorithm on G.711.1 and G.722 superwideband extension codec which is under standardization by ITU-T. The proposed codec not only provides an interoperable bitstream with ITU-T G.711.1 and G.722, but also encodes a superwideband signal with a bandwidth of 50-14,000 Hz using superwideband extension layer. The candidate codec consists of a core layer to provide an interoperability with conventional wideband codecs and superwideband extension layer using linear prediction-based sinusoidal coding. The proposed extension codec operates on 5ms frame and provides four superwideband bitrates of 64, 80, 96, and 112 kbit/s depending on the core codec. Since the resulting bitstream has an embedded structure, it can be converted into core bitstream by simple truncation without transcoding. The proposed codec has a short algorithmic delay and low complexity and passed the qualification test of G.711.1 and G.722 superwideband extension codec performed by ITU-T.

A Fast Multipoint-to-Point LSP Traffic Engineering for Differentiated Service in MPLS Networks (MPLS 망에서 차별화 된 서비스를 제공하기 위한 빠른 Multipoint-to-Point LSP 결정 방식)

  • Kim, Seong-Gwan;Jo, Yeong-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.5
    • /
    • pp.232-242
    • /
    • 2002
  • In a MPLS(Multiprotocol Label Switching) network, it is important to reduce the number of labels and LSP(Lable Switched Path)s for network resource management. MTP(Multipoint-to-Point) LSP can be used to solve this problem. In consideration of traffic engineering, MTP LSP must be chosen to enhance the availability of network and link utilization. Also, a fast mechanism to setup MTP LSPs is required for rerouting capability against link failure. In this paper, we propose a fast MTP LSP traffic engineering of multipath MTP LSP by using a mapping of a MTP LSP upon Diffserv PHBs(Per Hop Behavior) in a Diffserv-capable MPLS network. In the proposed traffic engineering, we determine multiple MTP LSPs in a hierarchical manner according to the characteristics of different services. By using Monte-Carlo method for traffic load balancing process, it provides fast rerouting capability in case of frequent link failure across large network. Out method produces to be nearly optimal within reasonable run-times. It's time complexity is in O( Cn$^2$logn) as conventional multipath routing and it is much faster than Linear Programming approach. Simulation results show that the proposed traffic engineering can be controlled effectively in an administrative manner and enhance the availability of network in comparison with conventional multipath routing.

A study on the design exploration of Optical Image Stabilization (OIS) for Smart phone (스마트폰을 위한 광학식 손떨림 보정 설계 탐색에 관한 연구)

  • Lee, Seung-Kwon;Kong, Jin-Hyeung
    • Journal of Digital Contents Society
    • /
    • v.19 no.8
    • /
    • pp.1603-1615
    • /
    • 2018
  • In order to achieve the low complexity and area, power in the design of Optical Image Stabilization (OIS) suitable for the smart phone, this paper presents the following design explorations, such as; optimization of gyroscope sampling rate, simple and accurate gyroscope filters, and reduced operating frequency of motion compensation, optimized bit width in ADC and DAC, evaluation of noise effects due to PWM driving. In experiments of gyroscope sampling frequencies, it is found that error values are unvaried in the frequency above 5KHz. The gyroscope filter is efficiently designed by combining the Fuzzy algorithm, to illustrate the reasonable compensation for the angle and phase errors. Further, in the PWM design, the power consumption of 2MHz driving is shown to decrease up to 50% with respect to the linear driving, and the imaging noises are reduced in the driving frequency above 2MHz driving frequency. The operating frequency could be reduced to 5KHz in controller and 10KHz in driver, respectively, in the motion compensation. For ADC and DAC, the optimized exploration experiments verify the minimum bit width of 11bits in ADC as well as 10bits in DAC without the performance degradation.

Disproof of Hadwiger Conjecture (Hadwiger 추측의 반증)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.263-269
    • /
    • 2014
  • In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.

An Adaptive Temporal Suppression for Reducing Network Traffic in Wireless Sensor Networks (무선 센서 네트워크에서 통신량 감소를 위한 적응적 데이터 제한 기법)

  • Min, Joonki;Kwon, Youngmi
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.10
    • /
    • pp.60-68
    • /
    • 2012
  • Current wireless sensor networks are considered to support more complex operations ranging from military to health care which require energy-efficient and timely transmission of large amounts of data. In this paper, we propose an adaptive temporal suppression algorithm which exploits a temporal correlation among sensor readings. The proposed scheme can significantly reduce the number of transmitted sensor readings by sensor node, and consequently decrease the energy consumption and delay. Instead of transmitting all sensor readings from sensor node to sink node, the proposed scheme is to selectively transmit some elements of sensor readings using the adaptive temporal suppression, and the sink node is able to reconstruct the original data without deteriorating data quality by linear interpolation. In our proposed scheme, sensing data stream at sensor node is divided into many small sensing windows and the transmission ratio in each window is decided by the window complexity. It is defined as the number of a fluctuation point which has greater absolute gradient than threshold value. We have been able to achieve up about 90% communication reduction while maintaining a minimal distortion ratio 6.5% in 3 samples among 4 ones.

Determinants of Private R&D Investment by Firms' Innovation Strategies - A Case study of Small and Medium Enterprises in Busan - (기업의 혁신전략에 따른 민간 연구개발 투자 영향 연구 - 부산지역 중소기업을 중심으로 -)

  • Park, Mun-su;Park, Sehee;Son, Wonbae;Kim, Bomi
    • Journal of Technology Innovation
    • /
    • v.27 no.3
    • /
    • pp.27-52
    • /
    • 2019
  • This research studied the determinants of private R&D investment by examining the innovation strategies of 481 small and medium enterprises (SMEs, their employee size is 5 or more and less than 300) in Busan, South Korea. The data is derived from the Technology Survey of Small and Medium Enterprises in 2001 and 2003. Three explanatory variables for the innovation strategies are the R&D portfolio, the organization (personnel) for R&D, and the strategic role of CEO for innovation. The technological levels of industries are controlled in the linear regression model. The dependent variable is the total private R&D investment of a firm in the given fiscal year. The empirical results indicate that the private R&D investment positively correlates with the complexity of the R&D portfolio, the formal organization for R&D team, and the increase of R&D personnel. The formal organization for R&D team and the number of R&D personnel are correlated with the increase of private R&D investment across the four groups in the manufacturing sector but not in the service sector. These findings suggest that the innovation policy needs to target firms who have complex R&D portfolios, the formal organization of R&D teams, and sufficient R&D personnel in order to increase the private R&D investment of SMEs in regions, with consideration of industrial characteristics.