• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.348-350
• /
• 2012

본 논문에서는 열 영상카메라를 통해 입력 받은 영상을 CS-LBP(Center-symmetric LBP)와 랜덤 포레스트(Random forest)를 이용하여 보행자 휴먼 객체를 검출하는 방법을 제안한다. 우선 불필요한 후보영역을 줄이기 위해 열 영상의 표준편차, 밝기 평균, 밝기 최대값을 이용하여 이진화하고, 신체부위 중 가장 발열이 강한 얼굴부위를 핫스팟 영역으로 설정한다. 그 후, 핫스팟 영역에서 CS-LBP특징을 추출하여 결정 트리의 앙상블인 랜덤 포레스트 분류기를 이용하여 최종적인 보행자 휴먼 객체를 검증한다. CS-LBP와 랜덤 포레스트 분류기를 통해 실시간 보행자 객체의 검출이 가능하고, 높은 검출 성능을 나타내었다.

• Annual Conference of KIPS
• /
• 2010.11a
• /
• pp.1029-1031
• /
• 2010

스마트폰이 활성화 되면서 자신만의 콘텐츠(사진, 글, 메모)를 스마트폰에서 작성하는 경우가 많아지게 되었다. 하지만 맛 집이나 데이트 코스 같은 핫스팟을 담은 콘텐츠를 블로그를 통해 공유하고 싶지만 그 방법이 한정되어 있다. 본 논문에서 다루는 GPS 블로그 서비스는 스마트폰에서 직접 블로그로 업로드 함으로써, 콘텐츠에 포함된 위치 정보를 블로그에 보다 빠르게 공유할 수 있다. 또한 현재 위치 정보를 맵을 통해서 블로그에 포스팅되기 때문에, 핫 스팟을 운영하는 업체 및 기업의 홍보를 보다 쉽게 가능하게 하는 효과가 있다.

• Proceedings of the KSME Conference
• /
• 2007.05b
• /
• pp.2449-2452
• /
• 2007

Hot spots on thin wafers of IC packages are becoming important issues in thermal and electrical engineering fields. To investigate these hot spots, we developed a Diode Temperature Sensor Array (DTSA) that consists of an array of 32 ${\times}$32 diodes (1,024 diodes) in a 8 mm ${\times}$ 8 mm surface area. To know specifically the hot spot temperature which is affected by the chip thickness and a generated power, we made the DTSA chips, which have 21.5 ${\mu}m$, 31 ${\mu}m$, 42 ${\mu}m$, 100 ${\mu}m$, 200 ${\mu}m$, and 400 ${\mu}m$ thickness using the CMP process. And we conducted the experiment using various heater power conditions (0.2 W, 0.3 W, 0.4 W, 0.5 W). In order to validate experimental results, we performed a numerical simulation. Errors between experimental results and numerical data are less than 4%. Finally, we proposed a correlation for the hot spot temperature as a function of the generated power and the wafer thickness based on the results of the experiment. This correlation can give an easy estimate of the hot spot temperature for flip chip packaging when the wafer thickness and the generated power are given.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.6
• /
• pp.1208-1214
• /
• 2009

Sensor networks are vulnerable to data congestion and hot-spot compared with wireless networks. Mobile sink supporting route protocol has such problems as hot-spot and data congestion because agent of cluster node transmits all data packet. Therefore, mobile sink supporting route protocol needs to reduce the number of packets and keep the packets from concentrating on a single node. To solve these problems, we propose mobile sink supporting routing Protocol using agent of cluster node. Cutting down on the number of packets compared with the existing mobile sink supporting routing Protocol, our proposed protocol has reduced both communication overhead and energy consumption.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.1
• /
• pp.382-389
• /
• 2012

The fabricated report attack will not only cause false alarms that waste real-world response efforts such as sending response teams to the event location, but also drains the finite amount of energy in a wireless sensor network. In this paper, we propose a probabilistic filtering method for sensor network security (PFSS) to deal with filtering for the fabricated report. On the basis of filtering scheme, PFSS combines cluster-based organization and probabilistic verification node assignment using distance of from cluster head to base station for energy efficiency and hot spot problem. Through both analysis and simulation, we demonstrate that PFSS could achieve efficient protection against fabricated report attack while maintaining a sufficiently high filtering power.

• Annual Conference of KIPS
• /
• 2019.10a
• /
• pp.370-371
• /
• 2019

태양 에너지 수집형 무선 센서 네트워크는 지속해서 에너지를 수집할 수 있어 배터리 기반 센서 네트워크의 에너지 제약 문제를 완화할 수 있지만, 고정된 싱크의 사용으로 싱크 주변에 존재하는 노드들이 상대적으로 에너지 소비가 증가하는 문제, 즉 에너지 사용 불균형 문제는 해결하지 못한다. 최근의 연구에서는 클러스터링을 기반으로 한 모바일 싱크를 도입하여 이를 해결하고자 했지만, 클러스터 헤드 및 그 주변 노드들의 에너지 부담은 여전히 존재한다. 한편, 무선 전력 전송 기술 발전에 따라 무선 센서 네트워크에서 모바일 싱크를 이용한 무선 전력 전송의 연구가 활발히 이루어지고 있다. 따라서 본 논문에서는 무선 전력 전송이 가능한 모바일 싱크와 효율적인 클러스터링 기법(클러스터 헤드 선출 포함)을 이용하여 에너지 불균형 문제를 최소화하는 기법을 제안한다. 제안 기법은 클러스터 헤드 및 헤드 주변 노드의 에너지 핫 스팟이 완화됨으로, 전체 네트워크의 정전 노드들이 감소하고 수집된 데이터양이 증가한 것을 성능평가를 통해 확인할 수 있다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.6
• /
• pp.2815-2822
• /
• 2011

Clustering method in wireless sensor networks is the technique that forms the cluster to aggregate the data and transmit them at the same time that they can use the energy efficiently. In this paper, I propose the hierarchical unequal clustering method using cluster group model. This divides the entire network into two layers. The data aggregated from layer 2 consisted of cluster group is sent to layer 1, after re-aggregation the total data is sent to base station. This method decreases whole energy consumption by using cluster group model with multi-hop communication architecture. Hot spot problem can be solved by establishing unequal cluster. I also show that proposed hierarchical unequal clustering method is better than previous clustering method at the point of network energy efficiency.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.218-230
• /
• 2008

The temporal aggregate in temporal databases is an extension of the conventional aggregate to include the time on the range condition of aggregation. It is a useful operation for Historical Data Warehouses, Call Data Records, and so on. In this paper, we propose a structure for the temporal aggregation with multiple selection predicates, called the ITA-tree, and an aggregate processing method based on the structure. In the ITA-tree, we transform the time interval of a record into a single value, called the T-value. Then, we index records according to their T-values like a $B^+$-tree style. For possible hot-spot situations, we also propose an improvement of the ITA-tree, called the eITA-tree. Through analyses and experiments, we evaluate the performance of the proposed method.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.5
• /
• pp.1193-1201
• /
• 2016

In epidemiology or etiology, we are often interested in identifying areas of elevated risk, so called, hot spot or cluster. Many existing clustering methods only tend to a result if there exists any clustering pattern in study area. Recently, however, lots of newly introduced clustering methods can identify the location, size, and shape of clusters and test if the clusters are statistically significant as well. In this paper, one of most commonly used clustering methods, scan statistic, and its implementation SaTScan software, which is freely available, will be introduced. To exemplify the usage of SaTScan software, we used cancer data from the SEER program of National Cancer Institute of U.S.A.We aimed to help researchers and practitioners, who are interested in spatial cluster detection, using female lung cancer mortality data of the SEER program.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1395-1404
• /
• 2000

In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.