• Journal of KIISE
• /
• v.44 no.9
• /
• pp.992-1004
• /
• 2017

To assess image quality accurately, an image quality assessment (IQA) metric is required to reflect the human visual system (HVS) properly. In other words, the structure, color, and contrast ratio of the image should be evaluated in consideration of various factors. In addition, as mobile embedded devices such as smartphone become popular, a fast computing speed is important. In this paper, the proposed IQA metric combines color similarity, gradient similarity, and phase similarity synergistically to satisfy the HVS and is designed by using optimized pooling and quantization for fast computation. The proposed IQA metric is compared against existing 13 methods using 4 kinds of evaluation methods. The experimental results show that the proposed IQA metric ranks the first on 3 evaluation methods and the first on the remaining method, next to VSI which is the most remarkable IQA metric. Its computing speed is on average about 20% faster than VSI's. In addition, we find that the proposed IQA metric has a bigger amount of correlation with the HVS than existing IQA metrics.

• Journal of Korea Multimedia Society
• /
• v.10 no.4
• /
• pp.441-449
• /
• 2007

In clustering for image segmentation, large amount of computation and typical segmentation errors have been important problems. In the paper, we suggest a new method for minimizing these problems. Markers in marker-controlled watershed transform represent segmented areas because they are starting-points of extending areas. Thus, clustering restricted by marker pixels can reduce computational complexity. In our proposed method, the markers are selected by Gabor texture energy, and cluster information of them are generated by FCM (fuzzy c-mean) clustering. Generated areas from watershed transform are merged by using cluster information of markers. In the test of Brodatz' texture images, we improved typical partition-errors obviously and obtained less computational complexity compared with previous FCM clustering algorithms. Overall, it also took regular computational time.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.17-22
• /
• 2009

DaVinci processors are popular media processors for implementing embedded multimedia applications. They support dual core architecture: ARM9 core for video I/O handling as well as system management and peripheral handling, and DSP C64+ core for effective digital signal processing. In this paper, we propose our efforts for optimal implementation of object tracking algorithm in DaVinci-based smart camera which is being designed and implemented by our laboratory. The smart camera in this paper is supposed to support object detection, object tracking, object classification and detection of intrusion into surveillance regions and sending the detection event to remote clients using IP protocol. Object tracking algorithm is computationally expensive since it needs to process several procedures such as foreground mask extraction, foreground mask correction, connected component labeling, blob region calculation, object prediction, and etc. which require large amount of computation times. Thus, if it is not implemented optimally in Davinci-based processors, one cannot expect real-time performance of the smart camera.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4C
• /
• pp.401-410
• /
• 2007

In this paper, we propose water quality monitoring system using vision camera and multiple objects tracking method. The proposed system analyzes object individually using vision camera unlike monitoring system using sensor method. The system using vision camera consists of individual object segmentation part and objects tracking part based on interrelation between successive frames. For real-time processing, we make background image using non-parametric estimation and extract objects using background image. If we use non-parametric estimation, objects extraction method can reduce large amount of computation complexity, as well as extract objects more effectively. Multiple objects tracking method predicts next motion using moving direction, velocity and acceleration of individual object then carries out tracking based on the predicted motion. And we apply exception handling algorithms to improve tracking performance. From experiment results under various conditions, it shows that the proposed system can be available for real-time water quality monitoring system since it has very short processing time and correct multiple objects tracking.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.49-60
• /
• 2010

H.264/AVC offers a better encoding efficiency than conventional video standards by adopting many new encoding techniques. However, the advanced coding techniques also add to the overall complexity for H.264/AVC encoder. Accordingly, it is necessary to perform optimization to alleviate the level of complexity for the video encoder. The amount of computation for motion estimation is of particular importance. In this paper, we propose a diamond web-grid search algorithm combined with efficient stationary block skip method which employs full diamond and dodecagon search patterns, and the variable thresholds are used for performing an effective skip of stationary blocks. The experimental results indicate that the proposed technique reduces the computations of the unsymmetrical-cross multi-hexagon-grid search algorithm by up to 12% while maintaining a similar PSNR performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1C
• /
• pp.69-77
• /
• 2002

Sine digital signal processing for motion pictures requires huge amount of data computation to store, manipulate and transmit, more effective data compression is necessary. Therefore, the ITU-T recommended H.26x as data compression standards for digital motion pictures. The data compression method that eliminates time redundancies by motion estimation using relationship between picture frames has been widely used. Most video conding systems employ block matching algorithm for the motion estimation and compensation, and the algorithm is based on the minimun value of cast functions. Therefore, fast search algorithm rather than full search algorithm is more effective in real time low data rates encodings such as H.26x. In this paper, motion estimation employing the Nearest-Neighbors algorithm is designed to reduce search time using FPGA, coded in VHDL, and simulated and verified using Xilink Foundation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.1
• /
• pp.35-45
• /
• 2007

The log data collected from mobile devices contains diverse meaningful and practical personal information. However, this information is usually ignored because of its limitation of memory capacity, computation power and analysis. We propose a novel method that detects landmarks of meaningful information for users by analyzing the log data in distributed modules to overcome the problems of mobile environment. The proposed method adopts Bayesian probabilistic approach to enhance the inference accuracy under the uncertain environments. The new cooperative modularization technique divides Bayesian network into modules to compute efficiently with limited resources. Experiments with artificial data and real data indicate that the result with artificial data is amount to about 84% precision rate and about 76% recall rate, and that including partial matching with real data is about 89% hitting rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.2
• /
• pp.495-504
• /
• 1996

In this paper, series-fed mirostrip array anteenas with coupling-slots are prposed and their operating characteristics are analyzed based on analyzed based on analytical and experimental results. An accurate analysis method for the slot-coupled feed structure is based on using both circuit coupling between anteenas and full-wave analysis which use travling wave mode and non-traveling wave mode on feed line. The basis functions that used for the numerical analysis bas been determined depending upon the accuracy, convergence properties of the solution, and the computation time:The patch uses 3 EB mode, the slot uses 1PWS mode, and feeders use 5 PWS mode. Series-fed array antennas have been designed, built, and tested in a standing-wave configuration. Using the results of the full-wave analysis, the chebyshev array antennas consisting of 8 elements are designed and fabricated changing the amount excited to each array element by adjusting slot length and by the slot position relative to the feeder. Experiment results show that the series-fed array antenna designed by adjusting the slot position relative to the feeder is superior to that designed by slot length.

• Journal of Korea Water Resources Association
• /
• v.31 no.6
• /
• pp.657-665
• /
• 1998

New diagnosing method o flood possibility was proposed. The method can be processed by following steps: first, decide if current available water resources are above normal or not; second, compute a consecutive period above normal; third, precipitation is accumulate through the period; fourth, daily depletion (runoff and evapotranspiration) amount is subtracted from the accumulated precipitation and remains are translated to one day's precipitation, which is called effective precipitation; and finally, effective precipitation index. the larger effective precipitation index means the higher flood possibility. This method has been applied to the flood event occurred in the central region of Korea at late July 1996 and compared with the study by Korea Water resources Association (1996). The new method is proven to be much faster in computation, and therefore much better in practical use for emergency situation than current rainfall-runoff models. It is because the new method simplifies some steps of currently used method such as parameter estimation and water level observation. It is also known that new method is more scientific than any other methods that use accumulated precipitation only as it considers the runoff depletion in time

• Journal of KIISE:Databases
• /
• v.32 no.2
• /
• pp.129-141
• /
• 2005

Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since to answer range sum queries, the direct access to a huge amount of data incurs prohibitive computation cost, materialization techniques based on existing index structures are recently suggested. A simple but effective solution is to apply the materialization technique to the MVR-tree known as the most efficient structure for window queries with spatio-temporal conditions. However, the MVR-tree has a difficulty in maintaining pre-aggregated results inside its internal nodes due to cyclic paths between nodes. Aggregate structures based on other index structures such as the HR-tree and the 3DR-tree do not provide satisfactory query performance. In this paper, we propose a new indexing technique called the Adaptive Partitioned Aggregate R-Tree (APART) and query processing algorithms to efficiently process range sum queries in many situations. Experimental results show that the performance of the APART is typically above 2 times better than existing aggregate structures in a wide range of scenarios.