• Title/Summary/Keyword: Combining weights

Search Result 93, Processing Time 0.028 seconds

A 2-GHz 8-bit Successive Approximation Digital-to-Phase Converter (2 GHz 8 비트 축차 비교 디지털-위상 변환기)

  • Shim, Jae Hoon
    • Journal of Sensor Science and Technology
    • /
    • v.28 no.4
    • /
    • pp.240-245
    • /
    • 2019
  • Phase interpolation is widely adopted in frequency synthesizers and clock-and-data recovery systems to produce an intermediate phase from two existing phases. The intermediate phase is typically generated by combining two input phases with different weights. Unfortunately, this results in non-uniform phase steps. Alternatively, the intermediate phase can be generated by successive approximation, where the interpolated phase at each approximation stage is obtained using the same weight for the two intermediate phases. As a proof of concept, this study presents a 2-GHz 8-bit successive approximation digital-to-phase converter that is designed using 65-nm CMOS technology. The converter receives an 8-phase clock signal as input, and the most significant bit (MSB) section selects four phases to create two sinusoidal waveforms using a harmonic rejection filter. The remaining least significant bit (LSB) section applies the successive approximation to generate the required intermediate phase. Monte-Carlo simulations show that the proposed converter exhibits 0.46-LSB integral nonlinearity and 0.31-LSB differential nonlinearity with a power consumption of 3.12 mW from a 1.2-V supply voltage.

A completely non-contact recognition system for bridge unit influence line using portable cameras and computer vision

  • Dong, Chuan-Zhi;Bas, Selcuk;Catbas, F. Necati
    • Smart Structures and Systems
    • /
    • v.24 no.5
    • /
    • pp.617-630
    • /
    • 2019
  • Currently most of the vision-based structural identification research focus either on structural input (vehicle location) estimation or on structural output (structural displacement and strain responses) estimation. The structural condition assessment at global level just with the vision-based structural output cannot give a normalized response irrespective of the type and/or load configurations of the vehicles. Combining the vision-based structural input and the structural output from non-contact sensors overcomes the disadvantage given above, while reducing cost, time, labor force including cable wiring work. In conventional traffic monitoring, sometimes traffic closure is essential for bridge structures, which may cause other severe problems such as traffic jams and accidents. In this study, a completely non-contact structural identification system is proposed, and the system mainly targets the identification of bridge unit influence line (UIL) under operational traffic. Both the structural input (vehicle location information) and output (displacement responses) are obtained by only using cameras and computer vision techniques. Multiple cameras are synchronized by audio signal pattern recognition. The proposed system is verified with a laboratory experiment on a scaled bridge model under a small moving truck load and a field application on a footbridge on campus under a moving golf cart load. The UILs are successfully identified in both bridge cases. The pedestrian loads are also estimated with the extracted UIL and the predicted weights of pedestrians are observed to be in acceptable ranges.

Landmark Selection Using CNN-Based Heat Map for Facial Age Prediction (안면 연령 예측을 위한 CNN기반의 히트 맵을 이용한 랜드마크 선정)

  • Hong, Seok-Mi;Yoo, Hyun
    • Journal of Convergence for Information Technology
    • /
    • v.11 no.7
    • /
    • pp.1-6
    • /
    • 2021
  • The purpose of this study is to improve the performance of the artificial neural network system for facial image analysis through the image landmark selection technique. For landmark selection, a CNN-based multi-layer ResNet model for classification of facial image age is required. From the configured ResNet model, a heat map that detects the change of the output node according to the change of the input node is extracted. By combining a plurality of extracted heat maps, facial landmarks related to age classification prediction are created. The importance of each pixel location can be analyzed through facial landmarks. In addition, by removing the pixels with low weights, a significant amount of input data can be reduced.

Voxel-wise UV parameterization and view-dependent texture synthesis for immersive rendering of truncated signed distance field scene model

  • Kim, Soowoong;Kang, Jungwon
    • ETRI Journal
    • /
    • v.44 no.1
    • /
    • pp.51-61
    • /
    • 2022
  • In this paper, we introduced a novel voxel-wise UV parameterization and view-dependent texture synthesis for the immersive rendering of a truncated signed distance field (TSDF) scene model. The proposed UV parameterization delegates a precomputed UV map to each voxel using the UV map lookup table and consequently, enabling efficient and high-quality texture mapping without a complex process. By leveraging the convenient UV parameterization, our view-dependent texture synthesis method extracts a set of local texture maps for each voxel from the multiview color images and separates them into a single view-independent diffuse map and a set of weight coefficients for an orthogonal specular map basis. Furthermore, the view-dependent specular maps for an arbitrary view are estimated by combining the specular weights of each source view using the location of the arbitrary and source viewpoints to generate the view-dependent textures for arbitrary views. The experimental results demonstrate that the proposed method effectively synthesizes texture for an arbitrary view, thereby enabling the visualization of view-dependent effects, such as specularity and mirror reflection.

A Study on Chaff Echo Detection using AdaBoost Algorithm and Radar Data (AdaBoost 알고리즘과 레이더 데이터를 이용한 채프에코 식별에 관한 연구)

  • Lee, Hansoo;Kim, Jonggeun;Yu, Jungwon;Jeong, Yeongsang;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.6
    • /
    • pp.545-550
    • /
    • 2013
  • In pattern recognition field, data classification is an essential process for extracting meaningful information from data. Adaptive boosting algorithm, known as AdaBoost algorithm, is a kind of improved boosting algorithm for applying to real data analysis. It consists of weak classifiers, such as random guessing or random forest, which performance is slightly more than 50% and weights for combining the classifiers. And a strong classifier is created with the weak classifiers and the weights. In this paper, a research is performed using AdaBoost algorithm for detecting chaff echo which has similar characteristics to precipitation echo and interrupts weather forecasting. The entire process for implementing chaff echo classifier starts spatial and temporal clustering based on similarity with weather radar data. With them, learning data set is prepared that separated chaff echo and non-chaff echo, and the AdaBoost classifier is generated as a result. For verifying the classifier, actual chaff echo appearance case is applied, and it is confirmed that the classifier can distinguish chaff echo efficiently.

Efficiency and Effectiveness of Government R&D Projects for SMEs (중소기업 R&D지원사업의 효율성과 효과성 분석)

  • Bae, Young Im
    • Journal of Technology Innovation
    • /
    • v.22 no.2
    • /
    • pp.77-104
    • /
    • 2014
  • Government R&D support for SMEs is very important and the R&D budget is also increasing. This study suggests a new method for analyzing a performance of R&D programs and analyzes the performance of R&D programs funded by small & medium business administration using the method. We discuss new measures "efficiency" that means short-term performance and "effectiveness" that means long-term performance. Weights based on the R&D programs' characteristics among the various sub-indicators of two measures were derived, and then the final scores were calculated by combining the weights with the responses on the indicators. Finally, this study tests the mean differences between R&D programs statistically. As a results, efficiency of R&D programs shows a significant difference between the R&D programs, while effectiveness does not. Most of the efficiency scores are low, whereas the effectiveness scores are high. The results explain that the R&D programs are managed inefficiently. However, most SMEs predict a positive impact of government R&D supports on effectiveness in the long term. Government needs to try to improve the efficiency of R&D supports because SMEs cannot expect sustainable performance with no improvement in efficiency.

Text Filtering using Iterative Boosting Algorithms (반복적 부스팅 학습을 이용한 문서 여과)

  • Hahn, Sang-Youn;Zang, Byoung-Tak
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.4
    • /
    • pp.270-277
    • /
    • 2002
  • Text filtering is a task of deciding whether a document has relevance to a specified topic. As Internet and Web becomes wide-spread and the number of documents delivered by e-mail explosively grows the importance of text filtering increases as well. The aim of this paper is to improve the accuracy of text filtering systems by using machine learning techniques. We apply AdaBoost algorithms to the filtering task. An AdaBoost algorithm generates and combines a series of simple hypotheses. Each of the hypotheses decides the relevance of a document to a topic on the basis of whether or not the document includes a certain word. We begin with an existing AdaBoost algorithm which uses weak hypotheses with their output of 1 or -1. Then we extend the algorithm to use weak hypotheses with real-valued outputs which was proposed recently to improve error reduction rates and final filtering performance. Next, we attempt to achieve further improvement in the AdaBoost's performance by first setting weights randomly according to the continuous Poisson distribution, executing AdaBoost, repeating these steps several times, and then combining all the hypotheses learned. This has the effect of mitigating the ovefitting problem which may occur when learning from a small number of data. Experiments have been performed on the real document collections used in TREC-8, a well-established text retrieval contest. This dataset includes Financial Times articles from 1992 to 1994. The experimental results show that AdaBoost with real-valued hypotheses outperforms AdaBoost with binary-valued hypotheses, and that AdaBoost iterated with random weights further improves filtering accuracy. Comparison results of all the participants of the TREC-8 filtering task are also provided.

A Text Mining-based Intrusion Log Recommendation in Digital Forensics (디지털 포렌식에서 텍스트 마이닝 기반 침입 흔적 로그 추천)

  • Ko, Sujeong
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.6
    • /
    • pp.279-290
    • /
    • 2013
  • In digital forensics log files have been stored as a form of large data for the purpose of tracing users' past behaviors. It is difficult for investigators to manually analysis the large log data without clues. In this paper, we propose a text mining technique for extracting intrusion logs from a large log set to recommend reliable evidences to investigators. In the training stage, the proposed method extracts intrusion association words from a training log set by using Apriori algorithm after preprocessing and the probability of intrusion for association words are computed by combining support and confidence. Robinson's method of computing confidences for filtering spam mails is applied to extracting intrusion logs in the proposed method. As the results, the association word knowledge base is constructed by including the weights of the probability of intrusion for association words to improve the accuracy. In the test stage, the probability of intrusion logs and the probability of normal logs in a test log set are computed by Fisher's inverse chi-square classification algorithm based on the association word knowledge base respectively and intrusion logs are extracted from combining the results. Then, the intrusion logs are recommended to investigators. The proposed method uses a training method of clearly analyzing the meaning of data from an unstructured large log data. As the results, it complements the problem of reduction in accuracy caused by data ambiguity. In addition, the proposed method recommends intrusion logs by using Fisher's inverse chi-square classification algorithm. So, it reduces the rate of false positive(FP) and decreases in laborious effort to extract evidences manually.

Performance Improvement of Downlink Real-Time Traffic Transmission Using MIMO-OFDMA Systems Based on Beamforming (Beamforming 기반 MIMO-OFDMA 시스템을 이용한 하향링크 실시간 트래픽 전송 성능 개선)

  • Yang Suck-Chel;Park Dae-Jin;Shin Yo-An
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.1-9
    • /
    • 2006
  • In this paper, we propose a MIMO-OFDMA (Multi Input Multi Output-Orthogonal Frequency Division Multiple Access) system based on beamforming for performance improvement of downlink real-time traffic transmission in harsh channel conditions with low CIR (Carrier-to-Interference Ratio). In the proposed system, we first consider the M-GTA-SBA (Modified-Grouped Transmit Antenna-Simple Bit Allocation) using effective CSI (Channel State Information) calculation procedure based on spatial resource grouping, which is adequate for the combination of MRT (Maximum Ratio Transmission) in the transmitter and MRC (Maximum Ratio Combining) in the receiver. In addition, to reduce feedback information for the beamforming, we also apply QEGT (Quantized Equal Gain Transmission) based on quantization of amplitudes and phases of beam weights. Furthermore, considering multi-user environments, we propose the P-SRA (Proposed-Simple Resource Allocation) algorithm for fair and efficient resource allocation. Simulation results reveal that the proposed MIMO-OFDMA system achieves significant improvement of spectral efficiency in low CRI region as compared to a typical open-loop MIMO-OFDMA system using pseudo-orthogonal space time block code and H-ARQ IR (Hybrid-Automatic Repeat Request Incremental Redundancy).

Comparison of Forest Growing Stock Estimates by Distance-Weighting and Stratification in k-Nearest Neighbor Technique (거리 가중치와 층화를 이용한 최근린기반 임목축적 추정치의 정확도 비교)

  • Yim, Jong Su;Yoo, Byung Oh;Shin, Man Yong
    • Journal of Korean Society of Forest Science
    • /
    • v.101 no.3
    • /
    • pp.374-380
    • /
    • 2012
  • The k-Nearest Neighbor (kNN) technique is popularly applied to assess forest resources at the county level and to provide its spatial information by combining large area forest inventory data and remote sensing data. In this study, two approaches such as distance-weighting and stratification of training dataset, were compared to improve kNN-based forest growing stock estimates. When compared with five distance weights (0 to 2 by 0.5), the accuracy of kNN-based estimates was very similar ranged ${\pm}0.6m^3/ha$ in mean deviation. The training dataset were stratified by horizontal reference area (HRA) and forest cover type, which were applied by separately and combined. Even though the accuracy of estimates by combining forest cover type and HRA- 100 km was slightly improved, that by forest cover type was more efficient with sufficient number of training data. The mean of forest growing stock based kNN with HRA-100 and stratification by forest cover type when k=7 were somewhat underestimated ($5m^3/ha$) compared to statistical yearbook of forestry at 2011.