• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.519-525
• /
• 2014

In this paper, we show a scheme to directly access DLNA network with the 3G/4G communication module of a smartphone in home or office environment. By exploiting this scheme, end users can use DLNA service more conveniently regardless of the type of activated communication module in a smartphone. For the implementation of this scheme, we use a femtocell that is a basestation with small coverage. A problem caused by the IP address hierarch discrepancy between the IP address of 3G/4G module of smartphone and those of local network nodes is resolved by deploying local IP address scheme. The processing of multicasting packet, that is required in DLNA service, is enabled by using IP tunneling scheme. As a result, end user can access DLNA network regardless of the type of activated wireless communication module. We validate the design result by implementing it on a commercial WCDMA femtocell.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2753-2758
• /
• 2014

Around-View, the image processing device which increases the comfort of drivers is sold in the market. This system prevents accidents in advance while driving or parking. The accidents are caused with their inexperienced driving or bad visibility. It is developed for driving convenience. However, it dosen't spread to the driver widely due to the problem of the high installation costs and complex installation process. First, expensive equipment second, difficult development environment and third, inconvenient installation procedure. So the drivers don't have many opportunities to use this system and dare to develop this system. I think if one of the problems can be solved, users might be able to access this system at low cost. In this paper, the AVM(Around-View Monitoring) minimizes two of them. Expensive equipment, inconvenient installation. The costly problems were solved by using low-cost USB device and rear cameras. In view of inconvenient installation process, the new system was designed to make it easy for people to install it. Through this, it can ease the burden of consumers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.11
• /
• pp.2640-2644
• /
• 2014

With the development of technology, wireless sensor networks (WSN) are wireless networks of consisting a large number of small and low-cost sensors. Wireless sensor networks facilitate collaboration to achieve the perception of information collection, processing and transmission tasks in deployment area. They have various purposes such as military, disaster relief, medical rescue, environmental monitoring, precision farming and manufacturing industry etc. Therefore, technologies for data maintaining technologies in sensor network environment is one of essential parts of sensor networks. In this paper, we present the essential particulars about data management technology at wireless sensor network environments and propound the issues. Further, we could organize and develop a systematic approach in solving the issues.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1934-1939
• /
• 2013

In this paper, we consider the online scheduling problem of jobs with deadlines. The jobs arrive over time and the scheduling algorithm has no information about the arriving jobs in advance. The jobs have the processing time of the equal length and the goal of the scheduling algorithm is to maximize the number of jobs completed in their deadlines. The performance of the online algorithm is compared with that of the optimal algorithm which has the full information about all the jobs. The raio of the two performances is called the competitive ratio. In general, the ratio is unbouned. So the case that the online algorithm can have more resources than the optimal algorithm is considered, which is called the resource augmentation analysis. In this paper, the online algorithm have more machines. We show that the online algorithm can have the same performance as the optimal algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.683-690
• /
• 2018

In this paper, a new signal processing technique is proposed for calibrating gain, phase, delay offsets in array antenna based anti-jamming minimum variance distortionless response (MVDR) global-positioning-system (GPS) receivers. The proposed technique estimates gain, phase and delay offsets across the antennas, and compensates for the offsets based on the estimates. A pilot signal with good correlation characteristics is used for accurate estimation of the gain, phase and delay offsets. Based on the cross-correlation, the delay offset is first estimated and then gain/phase offsets are estimated. For fine delay offset estimation and compensation, an interpolation technique is used, and specifically, the discrete Fourier transform (DFT) is employed for the interpolation technique to reduce the computational complexity. The proposed technique is verified through computer simulation using MATLAB. According to the simulation results, the proposed technique can reduce the gain, phaes and delay offset to 0.01 dB, 0.05 degree, and 0.5 ns, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.294-300
• /
• 2017

This paper proposes a method for 3-D sound source localization (SSL) using region selection and TDOA. 3-D SSL involves the estimation of an azimuth angle and an elevation angle. With the aim of reducing the computation time, we compare signal energies to select one out of three regions. In the selected region, we compute only one TDOA value for the azimuth angle estimation. Also, to estimate the vertical angle, we choose the higher energy signal from the selected region and pair it up with the elevated microphone's signal for TDOA computation and elevation angle estimation. Our experimental results show that the proposed method achieves average error values of $0.778^{\circ}$ in azimuth and $1.296^{\circ}$ in elevation, which is similar to other methods. The method uses one energy comparison and two TDOA computations therefore, the total processing time is reduced.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.4
• /
• pp.624-633
• /
• 2018

While the multimedia lecture system has been getting smart using immerging technology, the microphone still relies on the classical approach such as holding in hand or attaching on the body. In this paper, we propose a ceiling mounted array microphone system that allows a wide reception coverage and instructors to move freely without attaching microphone. The proposed system adopts cell and handover of mobile communication instead of a complicated beamforming method and implements a wide range microphone over several cells with low cost. Since the characteristics of unvoiced speech is similar to Pseudo Noise it is shown that soft handover are possible with 3 microphones connected to delay-sum multipath receiver. The proposed system is tested in $6.3{\times}1.5m$ area. For real-time processing the correlation range can be reduced by 82% or more, and the output latency delay can be improved by using the delay adaptive filter.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.406-417
• /
• 2001

With the advances in multimedia databases on the World Wide Web, it becomes more important to provide users with the search capability of distributed multimedia data. While there have been many studies about the database selection and the collection fusion for text databases. The multimedia databases on the Web have autonomous and heterogeneous properties and they use mainly the content based retrieval. The collection fusion problem of multimedia databases is concerned with the merging of results retrieved by content based retrieval from heterogeneous multimedia databases on the Web. This problem is crucial for the search in distributed multimedia databases, however, it has not been studied yet. This paper provides novel algorithms for processing the collection fusion of heterogeneous multimedia databases on the Web. We propose two heuristic algorithms for estimating the number of objects to be retrieved from local databases and an algorithm using the linear regression. Extensive experiments show the effectiveness and efficiency of these algorithms. These algorithms can provide the basis for the distributed content based retrieval algorithms for multimedia databases on the Web.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.418-429
• /
• 2001

Recently, a GIS has been applicable to the most important computer applications such as urban information systems and transportation information systems. These applications require spatial operations for an efficient management of a large volume of data. In particular, a spatial join among basic operations has the property that its response time is increased exponentially according to the number of spatial objects included in the operation. Therefore, it is not proper to the systems demanding the fast response time. To satisfy these requirements, the efficient parallel processing of spatial joins has been required. In this paper, the efficient method for creating and allocating tasks to balance statically the load of each processor in a parallel spatial join is presented. A task graph is developed in which a vertex weight is calculated by the cost model I have proposed. Then, it is partitioned through a graph partitioning algorithm. According to the experiments in CC16 parallel machine, our method made an improvement in the static load balance by decreasing the variance of a task execution time on each processor.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.344-356
• /
• 2001

This paper deals with the subsequence searching problem under time-warping in sequence databases. Our work is motivated by the observation that subsequence searches slow down quadratically as the average length of data sequences increases. To resolve this problem, the Segment-Based Approach for Subsequence Searches (SBSS) is proposed. The SBASS divides data and query sequences into a series of segments, and retrieves all data subsequences that satisfy the two conditions: (1) the number of segments is the same as the number of segments in a query sequence, and (2) the distance of every segment pair is less than or equal to a tolerance. Our segmentation scheme allows segments to have different lengths; thus we employ the time warping distance as a similarity measure for each segment pair. For efficient retrieval of similar subsequences, we extract feature vectors from all data segments exploiting their monotonically changing properties, and build a spatial index using feature vectors. Using this index, queries are processed with the four steps: (1) R-tree filtering, (2) feature filtering, (3) successor filtering, and (4) post-processing. The effectiveness of our approach is verified through extensive experiments.