• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.164-171
• /
• 2006

Recently Digital multimedia broadcasting (DMB) has been available as a commercial service. The users sometimes have difficulty in finding their preferred multimedia contents and need to spend a lot of searching time finding them. They are even very likely to miss their preferred contents while searching for them. In order to solve the problem, we need a method for recommendation users preferred only minimum information. We propose an algorithm and a system for recommending users' preferred contents using preference transition probability from user's usage history. The system includes four agents: a client manager agent, a monitoring agent, a learning agent, and a recommendation agent. The client manager agent interacts and coordinates with the other modules, the monitoring agent gathers usage data for analyzing the user's preference of the contents, the learning agent cleans the gathered usage data and modeling with state transition matrix over time, and the recommendation agent recommends the user's preferred contents by analyzing the cleaned usage data. In the recommendation agent, we developed the recommendation algorithm using a user's preference transition probability for the contents. The prototype of the proposed system is designed and implemented on the WIPI(Wireless Internet Platform for Interoperability). The experimental results show that the recommendation algorithm using a user's preference transition probability can provide better performances than a conventional method.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.269-277
• /
• 2007

Network clustering has been proposed to provide that sensor nodes minimize energy and maximize a network lifetime by configuring clusters, Although dynamic clustering brings extra overhead like as head changing, head advertisement, it may diminish the gain in energy consumption to report attribute tasks by using cluster heads. Therefore, this paper proposes a new routing algorithm which configures cluster to reduce the number of messages when establishing paths and reports to the sink by way of cluster heads when responding sens ing tasks. All sensor nodes only broadcast bitmap once and maintain a bitmap table expressed by bits, allowing them to reduce node energy and to prolong the network lifetime. After broadcasting, each node only updates the bitmap without propagation when the adjacent nodes broad cast same query messages, This mechanism makes nodes to have abundant paths. By modifying the query which requests sensing tasks, the size of cluster is designed dynamically, We try to divide cluster by considering the number of nodes. Then, all nodes in a certain cluster must report to the sub- sink node, The proposed routing protocol finds easily an appropriate path to report tasks and reduces the number of required messages for the routing establishment, which sensor nodes minimize energy and maximize a network lifetime.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.38-48
• /
• 2006

For extending of hot-spot of WLAN, (2) proposes internetworking scheme between wireless LAN (WLAN) and mobile ad-hoc network (MANET), which employ the same layer-2 protocol with different mode. Compared to internetworking schemes between UMTS (Universal Mobile Telecommunications Systems) and WLAN (3-4), the scheme from (2) has relatively low overhead and latencies because WLAN and MANET are physically and logically similar to each other. However, the mode switching algorithm proposed in r2] for internetworking between WLAN and MANET only considers signal strength and determines handoff, and mobile nodes following a zigzag course in pollution area may perform handoff at short intervals. Furthermore, (2) employs mobile IPv6 (MIPv6) at base, which brings still high delay on handoff and overhead due to signal message exchange. In this paper, we present optimized internetworking scheme between WLAN and MANET, modified from (2). To settle ping-pong handoff from (2), we propose adaptive mode switching algorithm. HMIPv6 is employed for IP connectivity and mobility service in WLAN, which solves some shortcomings, such as high handoff overhead and vulnerable security. For routing in MANET, OLSR is employed, which is a proactive Protocol and has optimally reduced signal broadcasting overhead. OLSR operates with current P protocol compatibly with no change or modification. The proposed internetworking scheme based on adaptive mode switching algorithm shows better performance than scheme from (2).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.135-142
• /
• 2013

Contour detection is important for many computer vision applications, such as shape discrimination and object recognition. In many cases, local luminance changes turn out to be stronger in textured areas than on object contours. Therefore, local edge features, which only look at a small neighborhood of each pixel, cannot be reliable indicators of the presence of a contour, and some global analysis is needed. The novelty of this operator is that dilation is limited to Deluanary triangular. An efficient implementation is presented. The grouping algorithm is then embedded in a multi-threshold contour detector. At each threshold level, small groups of edges are removed, and contours are completed by means of a generalized reconstruction from markers. Both qualitative and quantitative comparison with existing approaches prove the superiority of the proposed contour detector in terms of larger amount of suppressed texture and more effective detection of low-contrast contour.

• Journal of Broadcast Engineering
• /
• v.10 no.4 s.29
• /
• pp.488-504
• /
• 2005

In this paper, we propose a new bitrate control scheme to improve the quality of image encoded by SVC and to resolve the problems of conventional scheme. In JSVM2.0, bitrate of a frame is controlled by an initial quantization parameter and scaling factor that it hasdifferent value according to frame. Itis difficult to get the best of video quality at arbitrary bitrate because the conventional scheme has two defects. One is that we have to know proper initial QP's fur all sequences. Another is that QP's control skill for macroblocks is very inefficient. In this paper, we propose an efficient bit allocation algorithm to reduce the effect of the initial QP and to increase the efficiency of bit allocation by using proper QP's for macroblocks. In simulation results, it can be seen that using the proposed scheme enables the SVC encoder to control the bitrate by the macroblock unit and outperforms the conventional schemes in the respect of rate-distortion.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.2 s.332
• /
• pp.61-74
• /
• 2005

Digital Multimedia Broadcasting(DMB) is a reliable multi-service system for reception by mobile and portable receivers. DMB system allows interference-free reception under the conditions of multipath propagation and transmission errors using COFDM modulation scheme, simultaneously, needs powerful channel error's correction ability. Viterbi Decoder for DMB receiver uses punctured convolutional code and needs lots of computations for real-time operation. So, it is desired to design a high speed and low-power hardware scheme for Viterbi decoder. This paper proposes a combined add-compare-select(ACS) and path metric normalization(PMN) unit for computation power. The proposed PMN architecture reduces the problem of the critical path by applying fixed value for selection algorithm due to the comparison tree which has a weak point from structure with the high-speed operation. The proposed ACS uses the decomposition and the pre-computation technique for reducing the complicated degree of the adder, the comparator and multiplexer. According to a simulation result, reduction of area $3.78\%$, power consumption $12.22\%$, maximum gate delay $23.80\%$ occurred from punctured viterbi decoder for DMB system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.5
• /
• pp.77-87
• /
• 2018

Many researches have been focused on localization in WSNs. However, the solutions for localization in static WSN are hard to apply to the mobile WSN. The solutions for mobile WSN localization have the assumption that there are a significant number of anchor nodes in the networks. In the resource limited situation, these solutions are difficult in applying to the static and mobile mixed WSN. Without using the anchor nodes, a localization service cannot be provided in efficient, accurate and reliable way for mixed wireless sensor networks which have a combination of static nodes and mobile nodes. Also, accuracy is an important consideration for localization in the mixed wireless sensor networks. In this paper, we presented a method to satisfy the requests for the accuracy of the localization without anchor nodes in the wireless sensor networks. Hop coordinates measurements are used as an accurate method for anchor free localization. Compared to the other methods with the same data in the same category, this technique has better accuracy than other methods. Also, we applied a minimum spanning tree algorithm to satisfy the requests for the efficiency such as low communication and computational cost of the localization without anchor nodes in WSNs. The Java simulation results show the correction of the suggested approach in a qualitative way and help to understand the performance in different placements.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.107-118
• /
• 2011

This paper shows a u-Health management system in user's Life environment, which is different from previous ones by enterprises. It's designed for users(citizens) and service provider(especially providing medical service). This paper is discussing on the proof on the service model being operated near the Tancheon stream in the city of Sung-nam. To maximize users' satisfaction, this service has been designed on four disciplines(so easy, so simple, well-customized, funny feedback) in the viewpoint for users. Its algorithm has 4 levels which are measurement, prescription, monitoring and feedback. In the system. there are HCBs(health check boothes) checking out status and assessment of users, customized health prescription customized a health management service prescription engine, exercise programs customized on exercise equipments near the stream and monitoring system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.201-209
• /
• 2012

The point-based complex event processing handled an instantaneous event by using one time stamp in each event. However, the activity period of the event plays the important role in the field which is the same as the finance, multimedia, medicine, and meteorology. The point-based event is insufficient for expressing the complex temporal relationship in this field. In the application field of the real-time world, the event has the period. The events more than two kinds can be temporally overlapped. In addition, one event can include the other event. The relation about the events of kind of these can not be successive like the point-based event. This thesis designs and implements the method detecting the patterns of the complex event by using the interval-based events. The interval-based events can express the overlapping relation between events. Furthermore, it can include the others. By using the end point of beginning and end point of the termination, the operator of interval-based events shows the interval-based events. It expresses the sequence of the interval-based events and can detect the complex event patterns. This thesis proposes the algorithm using the active instance stack in order to raise efficiency of detection of the complex event patterns. When comprising the event sequence, this thesis applies the window push down technique in order to reduce the number of intermediate results. It raises the utility factor of the running time and memory.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.181-188
• /
• 2012

An effective extraction method for extracting a coated tongue is proposed in this paper, which is used as the diagnostic criteria in the tongue diagnosis. Proposed method uses the fluorescence response characteristics of the coated tongue that is occurred by using the ultraviolet light. Specially, this method can solved the previous problems including the issue in the limits of the diagnosis environment and in the objectivity of the diagnosis results. In our method, original tongue image is acquired by using the ultraviolet light, and binarization is performed by thresholding a valley-points in the histogram that corresponds to the color difference of tongue body and tongue coating. Final view image is presented to the oriental doctor, after applying the canny-edge algorithm to the binary image, and edge image is added to the original image. In order to evaluate the performance of the our proposed method, after building a various tongue image, we compared the true region of coated tongue by the oriental doctor's hand with the extracted region by the our method. As a result, the proposed method showed the average 87.87% extraction ratio. The shape of the extracted coated tongue region showed also significantly higher similarity.