• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.407-410
• /
• 2005

For reducing DFC(Dynamic False Contour), we propose a new PDP driving method by rearrangement of sub-fields. The proposed method constructs a frame using 16 sub-fields for expressing 256 gray levels. Although the number of sub-fields increases, the display time increases compared to the conventional 8 sub-fields driving method. This increase in display time is achieved by properly using both selective writing and selective erasing for each sub-field.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5354-5369
• /
• 2019

Sensor networks are deployed in unheeded environment to monitor the situation. In view of the unheeded environment and by the nature of their communication channel sensor nodes are vulnerable to various attacks most commonly malicious packet dropping attacks namely blackhole, grayhole attack and sinkhole attack. In each of these attacks, the attackers capture the sensor nodes to inject fake details, to deceive other sensor nodes and to interrupt the network traffic by packet dropping. In all such attacks, the compromised node advertises itself with fake routing facts to draw its neighbor traffic and to plunge the data packets. False routing advertisement play vital role in deceiving genuine node in network. In this paper, behavior based routing misbehavior detection (BRMD) is designed in wireless sensor networks to detect false advertiser node in the network. Herein the sensor nodes are monitored by its neighbor. The node which attracts more neighbor traffic by fake routing advertisement and involves the malicious activities such as packet dropping, selective packet dropping and tampering data are detected by its various behaviors and isolated from the network. To estimate the effectiveness of the proposed technique, Network Simulator 2.34 is used. In addition packet delivery ratio, throughput and end-to-end delay of BRMD are compared with other existing routing protocols and as a consequence it is shown that BRMD performs better. The outcome also demonstrates that BRMD yields lesser false positive (less than 6%) and false negative (less than 4%) encountered in various attack detection.

• 한국통신학회논문지
• /
• 제17권7호
• /
• pp.719-729
• /
• 1992

본 논문은 레이다 목표물 검파에 유용한 MXTM(maximum trmmed mea)-CFAR(constant false alarm rate) 처리기를 제안하고, 성능분석을 통하여 기존의 CFAR 처리기와 비교하였다. 제안된 MXTM-CFAR처리기는 클러터경계에서 좋은 성능을 갖는 GO(greatest of)-CFAR 처리기와 균질 또는 비균질상황에서 좋은 성능을 갖는 기존의 순서통계에 근거한 TM-CFAR 처리기를 결합한 형태이다. 균질상황, 간섭표적상화 및 클러터경계에서 구한 검파확률, 오경보율과 임계치를 통하여 성능을 분석하고 기존의 CFAR 처리기와 비교하였다. 제안된 처리기는 균질상황과 간섭표적상화에서 OS(order statistics)및 TM-CFAR 처리기와 같은 성능을 유지하면서 클러터 경계에서 오경보율을 줄일 수 있어으며 처리시간을 단축 시킬 수 있었다.

• 정보보호학회논문지
• /
• 제24권5호
• /
• pp.809-815
• /
• 2014

최근 정보통신 기술의 발달로 인하여 데이터의 양이 점차 증가하고 있으며, 이에 대한 처리와 관련된 연구가 활발히 진행되고 있다. 주어진 집합 내에 특정 개체의 존재여부를 알기위해 사용되고 있는 블룸필터는 데이터의 공간 활용에 매우 유용한 구조이다. 본 논문에서는 블룸필터에서 발생될 수 있는 오류 확률을 소개한다. 특히 실험실적 분석방법에 의하여 수정된 긍정오류 확률에 대한 일반식을 유도한다. 마지막으로 지금까지 사용되고 있는 블룸필터에 대한 긍정오류확률식과 이에 대한 관련논문을 이용하여 비교, 분석한다.

• 전기전자학회논문지
• /
• 제24권4호
• /
• pp.1148-1155
• /
• 2020

Fire must be extinguished as quickly as possible because they cause a lot of economic loss and take away precious human lives. Especially, the detection of smoke, which tends to be found first in fire, is of great importance. Smoke detection based on image has many difficulties in algorithm research due to the irregular shape of smoke. In this study, we introduce a new real-time smoke detection algorithm that reduces the detection of false positives generated by irregular smoke shape based on faster r-cnn of factory-installed surveillance cameras. First, we compute the global frame similarity and mean squared error (MSE) to detect the movement of smoke from the input surveillance camera. Second, we use deep learning algorithm (Faster r-cnn) to extract deferred candidate regions. Third, the extracted candidate areas for acting are finally determined using space and temporal features as smoke area. In this study, we proposed a new algorithm using the space and temporal features of global and local frames, which are well-proposed object information, to reduce false positives based on deep learning techniques. The experimental results confirmed that the proposed algorithm has excellent performance by reducing false positives of about 99.0% while maintaining smoke detection performance.

• 정보보호학회논문지
• /
• 제12권4호
• /
• pp.29-39
• /
• 2002

침입행위에 대한 비정상행위 탐지방법은 탐지에 대한 오판율이 높게 나타난다. 즉, 실제 침입이 아닌데 침입으로 판정하는 과탐지와 실제 침입인데 탐지하지 못하는 미탐지에 대한 오판율의 경우이다. 침입탐지의 민감도를 향상시키기 위하여 오용행위 및 비정상행위 탐지센서들 사이의 관련성을 이용하여 오판율을 감소하는 통합탐지의 방법을 연구하였다. 정상행위 및 비정상행위에 대해 하나의 탐지센서로부터의 결과가 다른 탐지센서에 의한 결과와 어떠한 관련성을 갖고 있는지의 반영비율을 오프라인에서 생성하고, 이를 실시간에 탐지된 결과에 적용하여 오판율을 감소하도록 하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권9호
• /
• pp.2377-2398
• /
• 2023

In our daily lives, we engage in a variety of tasks that rely on our senses, such as seeing. Blindness is the absence of the sense of vision. According to the World Health Organization, 2.2 billion people worldwide suffer from various forms of vision impairment. Unfortunately, blind people face a variety of indoor and outdoor challenges on a daily basis, limiting their mobility and preventing them from engaging in other activities. Blind people are very vulnerable to a variety of hazards, including falls. Various barriers, such as stairs, can cause a fall. The Internet of Things (IoT) is used to track falls and send a warning message to the blind caretakers. One of the gaps in the previous works is that they were unable to differentiate between falls true and false. Treating false falls as true falls results in many false alarms being sent to the blind caretakers and thus, they may reject the IoT system. As a means of bridging this chasm, this paper proposes an intelligent shoe that is able to precisely distinguish between false and true falls based on three sensors, namely, the load scale sensor, the light sensor, and the Flex sensor. The proposed IoT system is tested in an indoor environment for various scenarios of falls using four models of machine learning. The results from our system showed an accuracy of 0.96%. Compared to the state-of-the-art, our system is simpler and more accurate since it avoids sending false alarms to the blind caretakers.

• 한국컴퓨터정보학회논문지
• /
• 제16권10호
• /
• pp.121-129
• /
• 2011

무선 센서 네트워크에서 compromised node는 데이터 병합과정에서 허위 데이터를 삽입할 수 있다. 데이터 병합의 보안성을 위한 기존 접근 방법들은 높은 연산 부하를 요구한다. 따라서 본 논문에서는 허위 데이터 삽입 공격 발생 지점을 식별하는데 소요되는 통신 부하를 최소화하는 모니터링 기반 시큐어 데이터 병합 프로토콜을 제안한다. 제안된 프로토콜은 허위 데이터 삽입이 탐지되면 모니터링을 수행하고 있던 노드들의 MAC(Message Authentication Code)을 하나의 메시지로 요약하고 이를 BS(Base Station)로 전송하는 방법을 사용하며, BS는 이를 통해 공격 노드를 식별한다. 실험 결과는 제안된 프로토콜이 MAC들의 짧은 연결과 보통 연결을 사용하는 경우, 기존 연구에 비해 각각 45% 및 36% 적은 에너지를 사용하는 것으로 나타났다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.237-238
• /
• 2007

Fingerprint verification based on minutiae mostly has used because it stores a few data and is good for speed. However personal verification errors are caused by extracted from false minutiae. Therefore, in this paper, we propose a new methodology performing together based on image and minutiae. As the result of performing with image and minutiae, false accept rate and false reject rate are improved.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권3호
• /
• pp.163-168
• /
• 2015

Many IP address lookup approaches employ Bloom filters to obtain a high-speed search performance. Especially, it has been recently studied that the search performance of trie-based algorithms can be significantly improved by adding Bloom filters. In such algorithms, the number of trie accesses can be greatly reduced because Bloom filters can determine whether a node exists in a trie without actually accessing the trie. Bloom filters do not have false negatives but have false positives. False positives can lead to unnecessary trie accesses. The false positive rate must thus be reduced to enhance the performance of lookup algorithms applying Bloom filters. One important characteristic of trie-based algorithms is that all the ancestors of a node are also stored. The proposed algorithm utilizes this characteristic in reducing the false positive rate of a Bloom filter without increasing the size of the memory for the Bloom filter. When a Bloom filter produces a positive result for a node of a trie, we propose to check whether the ancestors of the node are also positives. Because Bloom filters have no false negatives, the negatives of any of the ancestors mean that the positive of the node is false. In other words, we propose to use more Bloom filter queries to reduce the false positive rate of a Bloom filter in trie-based algorithms. Simulation results show that querying one ancestor of a node can reduce the false positive rate by up to 67% with exactly the same architecture and the same memory requirement. The proposed approach can be applied to other trie-based algorithms employing Bloom filters.