• Journal of Korean Society for Geospatial Information Science
• /
• v.10 no.5 s.23
• /
• pp.45-51
• /
• 2002

The goal of image merging techniques are to enhance the resolution of low-resolution images using the detail information of the high-resolution images. Among the several image merging methods, wavelet-based image merging techniques have the advantages of efficient decorrelation of image bands and time-scale analysis. However, they have no regard for spatial information between the bands. In other words, multiresolution data merging methods merge the same information-the detail information of panchromatic image-with other band images, without considering specific characteristics. Therefore, a merged image contains much unnecessary information. In this paper, we discussed this 'mixing' effect and, proposed a method to classify the detail information of the panchromatic image according to the spatial and spectral characteristics, and to minimize distortion of the merged image.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4386-4404
• /
• 2016

Most existing salient object detection algorithms commonly employed segmentation techniques to eliminate background noise and reduce computation by treating each segment as a processing unit. However, individual small segments provide little information about global contents. Such schemes have limited capability on modeling global perceptual phenomena. In this paper, a novel salient object detection algorithm is proposed based on region merging. An adaptive-based merging scheme is developed to reassemble regions based on their color dissimilarities. The merging strategy can be described as that a region R is merged with its adjacent region Q if Q has the lowest dissimilarity with Q among all Q's adjacent regions. To guide the merging process, superpixels that located at the boundary of the image are treated as the seeds. However, it is possible for a boundary in the input image to be occupied by the foreground object. To avoid this case, we optimize the boundary influences by locating and eliminating erroneous boundaries before the region merging. We show that even though three simple region saliency measurements are adopted for each region, encouraging performance can be obtained. Experiments on four benchmark datasets including MSRA-B, SOD, SED and iCoSeg show the proposed method results in uniform object enhancement and achieve state-of-the-art performance by comparing with nine existing methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3B
• /
• pp.183-190
• /
• 2003

The explosion of the Internet has brought an acute need for efficient operation, which becomes to develop several technologies based on optical networks. By matching merging technology using wavelength multiplexing, an efficient administration with limited wavelength can provide scalability of network. The merging in optical layer has limitation of devices since the merging can not be performed in this layer. Hence the merging must be implemented in electronic layer. When the merging is implemented, the delay time would be increased in OXC (Optical Cross Connection), but the improvement of throughput rate will be expected in the process of explosive traffic due to reduction of optical channel supporting large bandwidth. In this thesis, we proposed an OXC of dual module having a merging function. We considered the optimum merging point with the largest in system performance and confirmed results using the simulation.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.299-300
• /
• 2006

In this paper, we propose a segmentation algorithm which combines the ideas from local watershed transforms and the region merging algorithm based hierarchical queue. Only the process of watershed and region merging algorithm can be restricted area. A fast region merging approach is proposed to extract the video object from the regions of watershed segmentation. Results show the effectiveness and convenience of the approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.725-733
• /
• 2000

In this paper, we propose a modified boundary block merging technique for the texture coding of MPEG-4. We propose an ORP(Optimized Region Partitioning) method that partition the VOP-based reference position to minimize the number of coding blocks. The merging possibility is improved by adding +90。and -90。 Rotation merging. We propose a MRM(Multiple Rotation Merging) method which applies the rotation merging in the order of 180。, +90。and -90。. If a pair of boundary blocks has low correlation, existing BBM's padding technique is not efficient. Our padding after merging method gives better result even if it has low correlation. The proposed method showed 5 ~8(%) coding bit reduction at the same PSNR values compared to BBM method.

• Management & Information Systems Review
• /
• v.6
• /
• pp.117-135
• /
• 2001

This study investigates whether the post-merger bad performance of merging firms was caused by the increase of cost and which cost is responsible for that, if it were. To do this, it is investigated whether there is any difference in terms of cost between pre-merger versus post-merger firms. Also the comparison of cost is used between merging firms and non-merging control groups. The finding is that the merging firms have a bigger cost than the non-merging control group and the post-merger firms have a bigger cost than the pre-merger firms. Especially labor cost to revenue and depreciation cost to revenue are statistically very different among them. Thus it is suggested that there are inefficiency of manpower and assets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.1060-1066
• /
• 2001

레이어2 스위칭과 레이어3 라우팅의 통합 모델로써 MPLS(Multi-Protocol Label Switching) 환경에서 ATM LSR(Label-Switching Routers)은 백본망에서의 고속 전송이 가능하여 현재의 라우터 구조로써 제안되어지고 있다. MPLS가 코어 라이터로써 적용이 될 경우 확장성을 위해 label merging이라는 기술이 필요하다. VC(Virtual Circuit) merging은 ATM LSR에서 많은 IP 라우터를 하나의 라벨로 매핑을 시키며 수천 개의 목적지에 전송할 수 있는 확장성 있는 매핑 기술이다. VC merging은 같은 목적지인 다른 패킷들 간의 셀들의 섞임을 방지하기 위해 재 조합 버퍼가 요구된다. 재 조합 버퍼 사용시 일시적인 체증 현상이 발생하며 Non-VC merging과 비교시 많은 셀 손실과 많은 버퍼를 요구하게 된다. 본 논문에서는 RED(Random Early Detection) 알고리즘을 적용하여 VC merging이 필요한 버퍼의 요구량과 셀 손실을 줄였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1537-1540
• /
• 2000

MPLS 는 ATM 과 같은 기존의 레이어 2 계층의 스위칭 기술을 사용하여 IP와 같은 레이어 3 계층기능을 효과적으로 제공하기 위해서 제안되었다. 이러한 MPLS가 코어라우터에 적용될 때 확장성을 제공하기 위한 필수적인 방안으로 VC merging 기능이 요구된다. VC merging 기능은 수신된 ATM 셀들을 VCC 별로 AAL5 프레임 단위로 다중화하고 동일한 목적지를 갖는 ATM 셀에 대해서 동일한 VPI/VCI 값을 갖도록 ATM 셀을 생성한다. 본 논문에서는 최대 1Gbps 데이터를 처리하는 SAR 소자를 사용하여 VC merging 장치를 구현하였다. 그리고 이를 MPLS 망에 적용시키기 위해서 VCC 연결 설정에 제한성을 갖는 SAR 소자에도 적용 가능한 연결 설정 및 해제 절차를 제공하였다.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.223-234
• /
• 2006

Branching and merging have been being the outstanding methods for SCM in terms of supporting parallel developments. Since well-known commercial merging tools based on textual merging have not detecting semantics conflicts, they can cause semantic errors in the result of merging. Although a lot of researches for detecting semantic conflict and merging up to recently, these researches have been doing individually. Therefore, it is necessary for a research detecting semantic conflict on textual merging and solving it. In this paper, we propose a new method for merging which preserve semantics on textual merging. The method merging two revisions from a source program is as follows : 1) defining changing operations, which include Update, Delete, and Insert operation, per line on two revisions corresponding to the line in source program, 2) detecting textual conflicts and semantic conflict in terms of executional behaviors, 3) solving these conflicts before merging. So, the proposed method can be regarded as a hybrid method that combines a method of textual merging and a behavioral semantic merging.

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

In order to support efficiently the multimedia applications, such as virtual classroom, video conferencing and tele-medical, the efficient multipoint-to-multipoint(MP-to-MP) connection management function is essential. Shared tree is reported as the most useful method for this purpose. In this paper we propose a new MP-to-MP connection setup & management scheme, called CIMA(Cell Interleaved Multiplexing on ATM) scheme,which is a VC merging method for MP-to-MP communication using shared tree. In the CIMA scheme,MRM cell delivers the cell merging information to the next node. The receiving node can identfy cells which arrived through a channel using the same VPI/VCI by the merging information in the MRM cell. Therefore the CIMA scheme can solve easily the Cell Interleaving Problem(CIP) that happens in VC merging. We analyzed the overhead of the proposed CIMA by mathematical analysis,and simulated the buffer usage of CIMA with OPNET. As the result of analysis,we found that the CIMA scheme has acceptable merging overhead and doesn't cause the buffer scare problem.