• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권7호
• /
• pp.2131-2153
• /
• 2022

To achieve accurate detection of tuberculosis (TB) areas in chest radiographs, we design a chest X-ray TB area detection algorithm. The algorithm consists of two stages: the chest X-ray TB classification network (CXTCNet) and the chest X-ray TB area detection network (CXTDNet). CXTCNet is used to judge the presence or absence of TB areas in chest X-ray images, thereby excluding the influence of other lung diseases on the detection of TB areas. It can reduce false positives in the detection network and improve the accuracy of detection results. In CXTCNet, we propose a channel attention mechanism (CAM) module and combine it with DenseNet. This module enables the network to learn more spatial and channel features information about chest X-ray images, thereby improving network performance. CXTDNet is a design based on a sparse object detection algorithm (Sparse R-CNN). A group of fixed learnable proposal boxes and learnable proposal features are using for classification and location. The predictions of the algorithm are output directly without non-maximal suppression post-processing. Furthermore, we use CLAHE to reduce image noise and improve image quality for data preprocessing. Experiments on dataset TBX11K show that the accuracy of the proposed CXTCNet is up to 99.10%, which is better than most current TB classification algorithms. Finally, our proposed chest X-ray TB detection algorithm could achieve AP of 45.35% and AP50 of 74.20%. We also establish a chest X-ray TB dataset with 304 sheets. And experiments on this dataset showed that the accuracy of the diagnosis was comparable to that of radiologists. We hope that our proposed algorithm and established dataset will advance the field of TB detection.

• Journal of Communications and Networks
• /
• 제15권4호
• /
• pp.370-382
• /
• 2013

Distributed massive MIMO systems, which have high bandwidth efficiency and can accommodate a tremendous amount of traffic using algorithms such as zero-forcing beam forming (ZFBF), may be deployed in large public venues with the antennas mounted under-floor. In this case the channel gain matrix H can be modeled as a multi-banded matrix, in which off-diagonal entries decay both exponentially due to heavy human penetration loss and polynomially due to free space propagation loss. To enable practical implementation of such systems, we present a multi-banded matrix inversion algorithm that substantially reduces the complexity of ZFBF by keeping the most significant entries in H and the precoding matrix W. We introduce a parameter p to control the sparsity of H and W and thus achieve the tradeoff between the computational complexity and the system throughput. The proposed algorithm includes dense and sparse precoding versions, providing quadratic and linear complexity, respectively, relative to the number of antennas. We present analysis and numerical evaluations to show that the signal-to-interference ratio (SIR) increases linearly with p in dense precoding. In sparse precoding, we demonstrate the necessity of using directional antennas by both analysis and simulations. When the directional antenna gain increases, the resulting SIR increment in sparse precoding increases linearly with p, while the SIR of dense precoding is much less sensitive to changes in p.

• 한국통신학회논문지
• /
• 제39B권10호
• /
• pp.715-721
• /
• 2014

두 개 센서에 도래하는 신호 간의 시간 지연을 추정 방법에는 여러 가지가 존재한다. 그 중에서 채널 추정 기법을 기반으로 한 방법의 경우는 두 센서에 입력되는 서로 다른 신호간의 상대적인 지연을 채널의 임펄스 응답처럼 추정하도록 되어 있다. 이 경우에는 해당 채널의 특성이 희박 채널의 특성을 가지고 있다. 기존의 방법들은 채널의 희박성을 이용하지 못하고 있는 방법이 대부분이다. 본 논문에서는 채널의 희박성을 이용하기 위하여 희박신호 최적화 방법의 하나인 LASSO 최적화를 사용한 시간 지연 추정 방법을 제안한다. 제안한 방법을 기존의 방법과 비교하여, 백색 가우시안 신호원에서는 약 10dB 이상의 성능 개선 결과를 보이고, 유색 신호원에서도 갑자기 추정성능이 열하되는 현상이 없음을 보인다.

• ETRI Journal
• /
• 제46권3호
• /
• pp.392-403
• /
• 2024

Even though generalized frequency division multiplexing is an alternative waveform method expected to replace the orthogonal frequency division multiplexing in the future, its implementation must alleviate channel effects. Least-squares (LS), a low-complexity channel estimation technique, could be improved by using the discrete Fourier transform (DFT) without increasing complexity. Unlike the usage of the LS method, the DFT-based method requires the receiver to know the channel impulse response (CIR) length, which is unknown. This study introduces a simple, yet effective, CIR length estimator by utilizing LS estimation. As the cyclic prefix (CP) length is commonly set to be longer than the CIR length, it is possible to search through the first samples if CP is larger than a threshold set using the remaining samples. An adaptive scale is also designed to lower the error probability of the estimation, and a simple signal-to-interference-noise ratio estimation is also proposed by utilizing a sparse preamble to support the use of the scale. A software simulation is used to show the ability of the proposed system to estimate the CIR length. Due to shorter CIR length of rural area, the performance is slightly poorer compared to urban environment. Nevertheless, satisfactory performance is shown for both environments.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2004년도 추계종합학술대회 논문 초록집
• /
• pp.228-228
• /
• 2004

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.524-539
• /
• 2014

To investigate schemes of secret key generation from Ultra-wideband (UWB) channel, we study a statistical characterization of UWB outdoor channel for a campus playground scenario based on extensive measurements. Moreover, an efficient secret key generation mechanism exploiting multipath relative delay is developed, and verification of this algorithm is conducted in UWB Line-of-sight (LOS) outdoor channels. For the first time, we compare key-mismatch probability of UWB indoor and outdoor environments. Simulation results demonstrate that the number of multipath proportionally affects key generation rate and key-mismatch probability. In comparison to the conventional method using received signal strength (RSS) as a common random source, our mechanism achieves better performance in terms of common secret bit generation. Simultaneously, security analysis indicates that the proposed scheme can still guarantee security even in the sparse outdoor physical environment free of many reflectors.

• 디지털산업정보학회논문지
• /
• 제9권1호
• /
• pp.111-118
• /
• 2013

This paper presents implementation of Air protocol analyzer and physical layer design algorithm. The analyzer is a measurement system providing real-time analysis of wireless signals between User Equipment (UE) and Node-B. The implemented system proposed in this paper consists of Digital Signal Processors (DSPs) and Field Programmable Gate Arrays (FPGAs). The waveform of Wideband Code Division Multiple Access (WCDMA) has been selected for verification of the proposed system. We designed the analyzer using equalizer algorithm and rake-receiver algorithm. Among various algorithms of designing the equalizer, we have chosen Linear Minimum Mean Square Error (LMMSE) equalizer that uses the inverse of channel matrix. Since the LMMSE equalizer uses the inverse channel matrix, it suffers from a large amount of computational load, while it outperforms most conventional equalizers. In this paper, we introduce an efficient procedure of reducing the computational load required by LMMSE equalizer-based receiver.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.999-1000
• /
• 2006

The LDPC Code is focusing a powerful FEC(Forward Error Correction) codes for 4G Mobile Communication system. LDPC codes are used minimizing channel errors by modeling AWGN Channel as VDSL system. The performance of LDPC code is better than that of turbo code in long code word on iterative decoding algorithm. LDPC code are encoded by sparse parity check matrix. there are decoding algorithms for a LDPC code, Bit Flipping, Message passing, Sum-Product. Because LDPC Codes use low density parity bit, mathematical complexity is low and relating processing time becomes shorten.

• 대한전자공학회논문지TC
• /
• 제46권4호
• /
• pp.46-55
• /
• 2009

RFID 환경에서 근접한 거리에 위치한 리더들이 동시에 동일 채널 또는 인접 채널을 사용할 경우 리더들 간 간섭을 일으키게 되는데 이를 리더 충돌이라 한다. 리더 충돌로 인해 리더의 명령이 태그에게 전송되지 않거나, 리더에 대해 태그가 응답할 수 없게 된다. 리더 충돌을 줄이기 위해 리더 충돌 방지 기법에 관한 연구가 이루어지고 있으며, ETSI에서는 다중 채널 환경에서 Listen-Before-Talk(LBT) 방식을 제안하고 있다. 그러나 이 방식에서는 채널 상황에 대한 고려 없이 채널을 임의로 선택하고, 채널 호핑을 수행한다. 또한, 채널을 점유하기 위해 여러 리더가 기다리는 경우 동시에 채널 상태를 확인하게 되어 리더 충돌을 효과적으로 줄이지 못한다. 본 논문에서는 다중 채널 환경을 고려한 LBT 방식을 기반으로 하되, 위 단점들을 보안한 알고리즘을 제안한다. 제안하는 알고리즘은 채널 센싱 랜덤 백오프를 사용하고, 효율적인 채널 호핑을 위해 채널 혼잡을 추정하는 기법을 제안하여 채널 호핑 여부를 판단한다. OPNET시뮬레이터를 통해 희소 리더 환경 및 밀집 리더 환경에서 제안하는 알고리즘의 우수성을 확인하고 검증한다.

• 한국산학기술학회논문지
• /
• 제15권10호
• /
• pp.6296-6302
• /
• 2014

본 논문에서, 가시광 발광 다이오드를 데이터 전송용 광원으로 사용하는 광무선 전송 시스템의 채널 용량을 증가시키는 새로운 기법을 제안하였다. 압축센싱을 기반으로 하는 적응형 샘플링 기법과 L1최소화 기법을 이용하여 직교 주파수 분할 다중방식기반 직교 위상천이 변조 (OFDM-QPSK: orthogonal frequency division multiplexed-qudarature phase shift keying) 데이터를 압축무선 전송한후, 수신단에서 복원하였다. 제안된 기법을 실험적으로 검증하기 위해서 소규모 링크를 이용하여 전송실험한 결과, OFDM-QPSK 데이터 전송률이 30.72Mb/s에서 51.2Mb/s로 증가함을 확인하였다. 이때의 오류벡터크기(EVM: error vector magnitude)값은 31%이었고, 에러정정 코드를 적용할 경우, 완벽하게 복원 가능함을 확인하였다.