• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.5
• /
• pp.151-158
• /
• 2023

The researchers entirely focused on meta-heuristic method for generalized assignment problem(GAP) that is known as NP-hard problem because of the optimal solution within polynomial time algorithm is unknown yet. On the other hand, this paper proposes a heuristic greedy algorithm with rules for finding solutions. Firstly, this paper reduces the weight matrix of original data to w_ij ≤ b_i/l in order to n jobs(items) pack m machines(bins) with l = n/m. The maximum profit of each job was assigned to the machine for the reduced data. Secondly, the allocation was adjusted so that the sum of the weights assigned to each machine did not exceed the machine capacity. Finally, the k-opt swap optimization was performed to maximize the profit. The proposed algorithm is applied to 50 benchmarking data, and the best known solution for about 1/3 data is to solve the problem. The remaining 2/3 data showed comparable results to metaheuristic techniques. Therefore, the proposed algorithm shows the possibility that rules for finding solutions in polynomial time exist for GAP. Experiments demonstrate that it can be a P-problem from an NP-hard.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.105-111
• /
• 2024

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.640-655
• /
• 2014

Many of today's video systems have additional depth camera to provide extra features such as 3D support. Thanks to these changes made in multimedia system, it is now much easier to obtain depth information of the video. Depth information can be used in various areas such as object classification, background area recognition, and so on. With depth information, we can achieve even higher coding efficiency compared to only using conventional method. Thus, in this paper, we propose the 2D video coding algorithm which uses depth information on top of the next generation 2D video codec HEVC. Background area can be recognized with depth information and by performing HEVC with it, coding complexity can be reduced. If current CU is background area, we propose the following three methods, 1) Earlier stop split structure of CU with PU SKIP mode, 2) Limiting split structure of CU with CU information in temporal position, 3) Limiting the range of motion searching. We implement our proposal using HEVC HM 12.0 reference software. With these methods results shows that encoding complexity is reduced more than 40% with only 0.5% BD-Bitrate loss. Especially, in case of video acquired through the Kinect developed by Microsoft Corp., encoding complexity is reduced by max 53% without a loss of quality. So, it is expected that these techniques can apply real-time online communication, mobile or handheld video service and so on.

• Journal of Broadcast Engineering
• /
• v.22 no.5
• /
• pp.570-577
• /
• 2017

Recently, with the development of broadcasting communication, users expect to receive high quality and various broadcasting services anytime, anywhere. In the case of terrestrial broadcasting, HD broadcasting and mobile broadcasting are provided at different frequencies. In the case of terrestrial UHD, which recently started trial broadcasting, 700MHz frequency is used which is different from the existing one. If the contents of the same contents are transmitted at different frequencies, it can be considered ineffective in terms of the use efficiency of the terrestrial broadcast frequency. As a method to solve this problem, a transmission system model and a service have been proposed for transmitting the hierarchical encoded UHD contents by SHVC on the basis of the multimedia transmission technology MMT in a heterogeneous network environment combining broadcast network and communication network. However, it is still in the initial stage of study the receiving model that can reliably receive various quality UHD contents in various environments such as mobile and fixed environment. Therefore, in this paper, we propose a receive buffer model that can reliably receive UHD contents layered on SHVC based on MMT.

• Journal of Broadcast Engineering
• /
• v.5 no.2
• /
• pp.199-210
• /
• 2000

The IBAC (In-Band Adjacent-Channel) DAB (Digital Audio Broadcasting) system is to provide multichannel CD quality audio services and multimedia data services including text and picture in FM band (88~105 MHz). As the FM band is being used by the existing analog radio broadcasting, there must he an analysis of the interference effect between IBAC DAB and analog FM signal. Therefore, the protection ratio should be evaluated to verify the system compatibility and allocate the new IBAC DAB channel in FM band. In this paper, among the three types of interferences, FM-to-DAB, DAB-to-FM and DAB-to-DAB, that can be occurred, the Protection ratio of IBAC DAB system for co-channel FM interferer is analyzed by modeling the FM interferer and considering the multipath fading channel. The simulation results show that IBAC DAB system has far better sensitivity than Eureka 147 and needs a relatively high protection ratio for co-channel FM interferer, because of its narrow bandwidth, about one third of that of Eureka 147.

• Journal of Broadcast Engineering
• /
• v.11 no.3 s.32
• /
• pp.263-275
• /
• 2006

This paper introduces an interactive contents authoring system which can easily and conveniently produce interactive contents for the Terrestrial Digital Multimedia Broadcasting (T-DMB). For interactive broadcasting service, T-DMB adopted MPEG-4 BIFS technology. In order to the interactive service becomes flourishing on the market, various types of interactive contents should be well provided prior to the service. In MPEG-4 BIFS, broadcasting contents are described by the combination of a large number of nodes, routes and descriptors. In order to provide interactive data services through the T-DMB network, it is essential to have an interactive contents authoring system which allows contents authors to compose interactive contents easily and conveniently even if they lack any background on MPEG-4 BIFS technology. The introduced authoring system provides powerful graphical user Interface and produces interactive broadcasting contents in the forms of binary and textual format. Therefore, the BIFS contents authoring system presented in this paper would vastly contribute to the flourishing interactive service.

• Journal of Broadcast Engineering
• /
• v.11 no.3 s.32
• /
• pp.336-348
• /
• 2006

The recent advances in multimedia signal coding and transmission technologies allow lots of users to watch videos on small LCD displays. In this paper, we briefly describe an intelligent display technique to provide small-display-viewers with comfortable experiences, and study the minimum image size tolerated and utility of displaying region of interest (ROI) only when needed. The study, with 111 participants, examines minimum image size to ensure viewers pleasant viewing experiences, and evaluates the degree of satisfaction when they are viewed with region of interest (ROI) only. The experimental results show that the ROI display enhances the viewers' satisfaction when the image size becomes less than $320{\times}240$, and thus it is useful to provide the intelligent display, if necessary, which can extract and display ROI only.

• Journal of Broadcast Engineering
• /
• v.22 no.6
• /
• pp.744-754
• /
• 2017

This paper compares transport overhead of MPEG-2 TS, MMT and ROUTE in order to compare transport efficiency between the DTV and UHDTV. The MPEG-2 TS standard, widely used, was established for multiplexing and synchronizing encoded audio and video, additional information. In recent years, MMT and ROUTE was established as a next generation multimedia transport standard for the new broadcasting communication environment. In this paper, we compare and analyze transport overhead about three protocol. In order to analysis, we captured the UHD A/V stream in real-time broadcasting service using ROUTE and MMT, and we calculated and analyzed transport overhead using the overhead analysis program which was developed in our laboratory. Furthermore, for comparison under the same conditions, we assumed the MPEG-2 TS stream by extracting ES of UHD A/V stream based on the DTV standard. In this paper, we show the results of protocol transport efficiency in case of basic A/V stream except for additional services. And result show that MMT and ROUTE have similar overhead and MPEG-2 TS is relatively small overhead. However, since MPEG-2 TS result does not consider null packets, it is expected that the relative overhead difference will be reduced.