• 한국멀티미디어학회논문지
• /
• 제19권12호
• /
• pp.1927-1935
• /
• 2016

This paper propose a framework for human body parts in RGB-D image. We conduct tasks of obtaining person area, finding candidate areas and local detection in order to detect hand, foot and head which have features of long accumulative geodesic distance. A person area is obtained with background subtraction and noise removal by using depth image which is robust to illumination change. Finding candidate areas performs construction of graph model which allows us to measure accumulative geodesic distance for the candidates. Instead of raw depth map, our approach constructs graph model with segmented regions by quadtree structure to improve searching time for the candidates. Local detection uses HOG based SVM for each parts, and head is detected for the first time. To minimize false detections for hand and foot parts, the candidates are classified with upper or lower body using the head position and properties of geodesic distance. Then, detect hand and foot with the local detectors. We evaluate our algorithm with datasets collected Kinect v2 sensor, and our approach shows good performance for head, hand and foot detection.

• The Korean Journal of Pain
• /
• 제2권2호
• /
• pp.198-202
• /
• 1989

우측 암면부, 특히 안구주위에 심한 통증을 호소하고 안검하수와 더불어 우측안구의 완전마비를 동반한 선천성 난장이 환자를 경험하였던 바 이는 신경방사선과학적소견, 검사실 검사소견, 전신적 corticosteroid치료에 대한 반응이 전형적인 Tolosa-Hunt Syndrome과는 다른 비전형적인 Tolosa-Hunt Syndrome이었기에 문헌적 고찰과 함께 보고하는 바이다.

• ETRI Journal
• /
• 제35권2호
• /
• pp.281-291
• /
• 2013

A video signature is a set of feature vectors that compactly represents and uniquely characterizes one video clip from another for fast matching. To find a short duplicated region, the video signature must be robust against common video modifications and have a high discriminability. The matching method must be fast and be successful at finding locations. In this paper, a frame-based video signature that uses the spatial information and a two-stage matching method is presented. The proposed method is pair-wise independent and is robust against common video modifications. The proposed two-stage matching method is fast and works very well in finding locations. In addition, the proposed matching structure and strategy can distinguish a case in which a part of the query video matches a part of the target video. The proposed method is verified using video modified by the VCE7 experimental conditions found in MPEG-7. The proposed video signature method achieves a robustness of 88.7% under an independence condition of 5 parts per million with over 1,000 clips being matched per second.

• BMB Reports
• /
• 제36권6호
• /
• pp.558-564
• /
• 2003

In microarray data mining, one of the key problems is how to handle weak signals. Based on a bent piecewise linear accumulated distribution generally found in the microarray data, a new detectable threshold finding method is proposed to filter genes with unreliable information in this paper. More reliable and reproducible data is produced for the subsequent data mining.

• 한국동물위생학회지
• /
• 제30권3호
• /
• pp.407-414
• /
• 2007

There were eight Korean indigenous cattles affected with bovine tuberculosis (BTB) detected by inspectors at slaughterhouses located in Chungbuk province from May 2006 through July 2007. Postmortem finding of BTB cases was characterized by the presence of several caseous or calcified nodules encapsulated by connective tissue from the pleural/peritoneal surface, livers, lungs and regional lymph nodes On micro-scopic examinations, the characteristic lesion of BTB was the formation granulomatous nodules, which contains central calcified necrotic zone surrounded by epithelioid cells, macrophages and a few Langhans' type giant cells. In addition, mononuclear cells and fibroblasts were also infiltrated. At the periphery, encapsulation was formed that protect the neighboring healthy tissues.

• 한국공간정보시스템학회:학술대회논문집
• /
• 한국공간정보시스템학회 2005년도 추계학술대회
• /
• pp.61-66
• /
• 2005

Spatiotemporal data mining represents the confluence of several fields including spatiotemporal databases, machine loaming, statistics, geographic visualization, and information theory. Exploration of spatial data mining and temporal data mining has received much attention independently in knowledge discovery in databases and data mining research community. In this paper, we introduce an algorithm Max_MOP for discovering moving sequences in mobile environment. Max_MOP mines only maximal frequent moving patterns. We exploit the characteristic of the problem domain, which is the spatiotemporal proximity between activities, to partition the spatiotemporal space. The task of finding moving sequences is to consider all temporally ordered combination of associations, which requires an intensive computation. However, exploiting the spatiotemporal proximity characteristic makes this task more cornputationally feasible. Our proposed technique is applicable to location-based services such as traffic service, tourist service, and location-aware advertising service.

• ETRI Journal
• /
• 제36권3호
• /
• pp.374-384
• /
• 2014

To achieve high-speed (giga-bit) connectivity for short-range wireless multimedia applications, the millimeter-wave (mmWave) wireless personal area networks with directional antennas are gaining increased interest. Due to the use of directional antennas and mmWave communications, the probability of non-interfering transmissions increases in a localized region. Network throughput can be increased immensely by the concurrent time allocation of non-interfering transmissions. The problem of finding optimum time allocation for concurrent transmissions is an NP-hard problem. In this paper, we propose two enhanced versions of previously proposed multi-hop concurrent transmission (MHCT) schemes. To increase network capacity, the proposed schemes efficiently make use of the free holes in the time-allocation map of the MHCT scheme; thus, making it more compact.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3100-3116
• /
• 2016

With the rapid development of urban traffic system and fast increasing of vehicle numbers, the traditional centralized ways to generate the source-destination shortest path in terms of travel time(the optimal path) encounter several problems, such as high server pressure, low query efficiency, roads state without in-time updating. With the widespread use of smart cameras in the urban traffic and surveillance system, this paper maps the optimal path finding problem in the dynamic road network to the shortest routing problem in the smart camera networks. The proposed distributed optimal path generation algorithm employs the delay routing and caching mechanism. Real-time route update is also presented to adapt to the dynamic road network. The test result shows that this algorithm has advantages in both query time and query packet numbers.

• 한국어병학회지
• /
• 제30권1호
• /
• pp.67-70
• /
• 2017

Pseudomonas is currently causing increasing mortality in farmed olive flounder in Jeju Island. It was previously reported that P. anguilliseptica is the pathogen causing the mortality. It is not known whether other sub-species are involved or not. In this study, P. fluorescens was identified from diseased olive flounder by a PCR-based diagnosis. Based on genomic sequencing and BLAST analysis, 5 out of 6 samples were closer with P. fluorescens than P. anguilliseptica. Our finding suggests that P. fluorescens may be the dominant species causing the disease in farmed olive flounder in Jeju Island, South Korea.

• 한국공간정보시스템학회:학술대회논문집
• /
• 한국공간정보시스템학회 2004년도 국내 LBS 기술개발 및 표준화 동향세미나
• /
• pp.69-74
• /
• 2004

Selectivity estimation for spatial query is very important process in finding the most efficient execution plan. Many works have been performed to estimate accurately selectivity. Although they deal with some problems such as false-count, multi-count, they require a large amount of memory to retain accurate selectivity, so they can not get good results in little memory environments such as mobile-based small database. In order to solve this problem, we propose a new technique called MW histogram which is able to compress summary data and get reasonable results. It also has a flexible structure to react dynamic update. The experimental results showed that the MW histogram has lower relative error than MinSkew histogram and gets a good selectivity in little memory.