• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1183-1195
• /
• 2020

Visual saliency detection is an essential task because it is an important part of various vision-based applications. There are many techniques for saliency detection in color images. However, the number of methods for saliency detection in infrared images is limited. In this paper, we introduce a simple approach for saliency detection in infrared images based on the thresholding technique. The input image is thresholded into several Boolean maps, and an initial saliency map is calculated as a weighted sum of the created Boolean maps. The initial map is further refined by using thresholding, morphology operation, and a Gaussian filter to produce the final, high-quality saliency map. The experiment showed that the proposed method has high performance when applied to real-life data.

• 제어로봇시스템학회논문지
• /
• 제21권10호
• /
• pp.965-971
• /
• 2015

This paper suggests a feature point-based Iterative Closest Point (ICP) algorithm to compensate for the disparity error in building a two-dimensional map. The ICP algorithm is a typical algorithm for matching a common object in two different images. In the process of building a two-dimensional map using the laser scanner data, warping and distortions exist in the map because of the disparity between the two sensor values. The ICP algorithm has been utilized to reduce the disparity error in matching the scanned line data. For this matching process in the conventional ICP algorithm, pre-known reference data are required. Since the proposed algorithm extracts characteristic points from laser-scanned data, reference data are not required for the matching. The laser scanner starts from the right side of the mobile robot and ends at the left side, which causes disparity in the scanned line data. By finding the matching points between two consecutive frame images, the motion vector of the mobile robot can be obtained. Therefore, the disparity error can be minimized by compensating for the motion vector caused by the mobile robot motion. The validity of the proposed algorithm has been verified by comparing the proposed algorithm in terms of map-building accuracy to conventional ICP algorithm real experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.1121-1139
• /
• 2015

In texture-plus-depth format, depth map compression is an important task. Different from normal texture images, depth maps have less texture information, while contain many homogeneous regions separated by sharp edges. This feature will be employed to form an efficient depth map coding scheme in this paper. Firstly, the histogram of the depth map will be analyzed to find an appropriate threshold that segments the depth map into the foreground and background regions, allowing the edge between these two kinds of regions to be obtained. Secondly, the two regions will be encoded through rate distortion optimization with a shape adaptive wavelet transform, while the edges are lossless encoded with JBIG2. Finally, a depth-updating algorithm based on the threshold and the depth range is applied to enhance the quality of the decoded depth maps. Experimental results demonstrate the effective performance on both the depth map quality and the synthesized view quality.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2012년도 춘계학술대회
• /
• pp.831-832
• /
• 2012

본 연구는 지방자치별로 제작된 전자재해지도의 구축 현황과 문제점에 대해 알아본다. 다수의 지자체들이 전자재해지도를 구축하여 서비스하고 있지만, 단순한 기능만을 제공하거나 서비스의 활용이 저조하다. 이러한 이유에 대해 알아보고, 개선방향에 대해 연구한다.

• 한국전자통신학회논문지
• /
• 제8권1호
• /
• pp.1-6
• /
• 2013

본 논문에서는 그린 IT의 지식 맵 작성을 위한 기반 단계 그린 IT의 전세계적인 환경 분석을 위한 전제로서 개요들을 살펴본다. 이 전제를 기반으로 그린 IT에 대하여 본격적인 환경을 분석할 수 있으며 이 환경 분석 후에 지식 재산권을 기반으로 경쟁력을 분석하는데 이용할 수 있을 것으로 기대한다.

• 한국전자통신학회논문지
• /
• 제8권1호
• /
• pp.7-12
• /
• 2013

본 논문에서는 LED의 지식 맵 구성을 위한 방법의 하나로서 국적별 특허 활동성 분석, 출원인별 특허 활동성 분석, 기술 분야별 특허 활동성 분석과 질적 수준을 고려한 시장 확보력에 대한 경쟁 현황 분석을 통하여 지식 맵 구성의 기본적인 데이터를 제공하고자 한다.

• ETRI Journal
• /
• 제30권1호
• /
• pp.113-128
• /
• 2008

Turbo codes are extensively used in current communications standards and have a promising outlook for future generations. The advantages of software defined radio, especially dynamic reconfiguration, make it very attractive in this multi-standard scenario. However, the complex and power consuming implementation of the maximum a posteriori (MAP) algorithm, employed by turbo decoders, sets hurdles to this goal. This work introduces an ASIP architecture for the MAP algorithm, based on a dual-clustered VLIW processor. It displays the good performance of application specific designs along with the versatility of processors, which makes it compliant with leading edge standards. The machine deals with multi-operand instructions in an innovative way, the fetching and assertion of data is serialized and the addressing is automatized and transparent for the programmer. The performance-area trade-off of the proposed architecture achieves a throughput of 8 cycles per symbol with very low power dissipation.

• 한국전자통신학회논문지
• /
• 제7권4호
• /
• pp.897-904
• /
• 2012

이 논문은 사이버공간에서 비즈니스를 시작하고 확장해가는 과정을 로드맵으로 제안하였다. 사이버 비즈니스가 성공하기 위해서는 사이버공간의 특성, 비즈니스의 특성 그리고 사업자 자신의 상황이 조화롭게 통합되어야 하는데, 그 통합 과정을 로드맵으로 함축시켰다. 제안하는 로드맵은 사이버공간의 특성에 대한 이해의 점진적 확장과 더불어 사이버 비즈니스를 점진적으로 확장해 가는 방법을 지향하고 있다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제8권1호
• /
• pp.83-90
• /
• 2016

The emergence of cloud has been able to provide a variety of IT service to the user. As organizations and companies are increased that provide these cloud service, many problems arises on integration. However, with the advent of latest technologies such as big data, document-oriented database, and MapReduce, this problem can be easily solved. This paper is intended to design the Cloud Aggregator to provide them as a service to collect information of the cloud system providing each service. To do this, we use the DBaaS(DataBase as a Service) and MapReduce techniques. This makes it possible to maintain the functionality of existing system and correct the problem that may occur depending on the combination.

• 반도체디스플레이기술학회지
• /
• 제15권4호
• /
• pp.103-106
• /
• 2016

3D technology is main factor in Augmented Reality. Depth map is essential to make cubic effect using 2d image. There are a lot of ways to construct Depth map. Among them, stereo matching is mainly used. This paper presents how to generate depth map using stereo matching. For stereo matching, existing Dynamic programming method is used. To make accurate stereo matching, High-Boost Filter is applied to preprocessing method. As a result, when depth map is generated, accuracy based on Ground Truth soared.