• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.521-521
• /
• 2000

This paper investigates the problem of robust H$_{\infty}$ filter with FIR(Finite Impulse Response) structure for linear continuous time-varying systems with sampled-data measurements. It is assumed that the system is subject to real time-varying uncertainty which is represented by the state-space model having parameter uncertainty. The robust H$_{\infty}$ FIR filter is proposed for the continuous-time linear parameter uncertain systems. It is also derived from the equivalence relationship between the robust linear H$_{\infty}$ FIR filter and the robust linear H$_{\infty}$ filter with sampled-data measurements.

• Journal of Broadcast Engineering
• /
• v.13 no.4
• /
• pp.452-462
• /
• 2008

In this paper, we address issues associated with the real-time implementation of the MPEG-1/2 Layer-II (or MUSICAM) and MPEG-4 ER-BSAC decoders for Digital Multimedia Broadcasting (DMB) on TMS320C64x+ that is a fixed-point DSP processor with a clock speed of 330 MHz. To achieve the real-time requirement, they should be optimized in different steps as follows. First of all, a C-code level optimization is performed by sharing the memory, adjusting data types, and unrolling loops. Next, an algorithm level optimization is carried out such as the reconfiguration of bitstream reading, the modification of synthesis filtering, and the rearrangement of the window coefficients for synthesis filtering. In addition, the C-code of a synthesis filtering module of the MPEG-1/2 Layer-II decoder is rewritten by using the linear assembly programming technique. This is because the synthesis filtering module requires the most processing time among all processing modules of the decoder. In order to show how the real-time implementation works, we obtain the percentage of the processing time for decoding and calculate a RMS value between the decoded audio signals by the reference MPEG decoder and its DSP version implemented in this paper. As a result, it is shown that the percentages of the processing time for the MPEG-1/2 Layer-II and MPEG-4 ER-BSAC decoders occupy less than 3% and 11% of the DSP clock cycles, respectively, and the RMS values of the MPEG-1/2 Layer-II and MPEG-4 ER-BSAC decoders implemented in this paper all satisfy the criterion of -77.01 dB which is defined by the MPEG standards.

• Journal of Korean Society of Transportation
• /
• v.26 no.4
• /
• pp.241-250
• /
• 2008

With the ever-growing amount of traffic, there is an increasing need for good quality travel time information. Various existing outlier filtering and missing data imputation algorithms using AVI data for interrupted and uninterrupted traffic flow have been proposed. This paper is devoted to development of an outlier filtering and missing data imputation algorithm by using Toll Collection System (TCS) data. TCS travel time data collected from August to September 2007 were employed. Travel time data from TCS are made out of records of every passing vehicle; these data have potential for providing real-time travel time information. However, the authors found that as the distance between entry tollgates and exit tollgates increases, the variance of travel time also increases. Also, time gaps appeared in the case of long distances between tollgates. Finally, the authors propose a new method for making representative values after removal of abnormal and "noise" data and after analyzing existing methods. The proposed algorithm is effective.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.4
• /
• pp.255-261
• /
• 2000

This paper presents the results of the robust H(sub)$\infty$ FIR filtering for a class of nonlinear continuous time-varying systems subject to real norm-bounded parameter uncertainty and know Lipschitz nonlinearity under sampled measurements. We address the problem of designing filters, using sampled measurements, which guarantee a prescribed H(sub)$\infty$ performance in continuous time-varying context, irrespective of the parameter uncertainty and unknown initial states. The infinite horizon causal H(sub)$\infty$FIR filter are investigated using the finite moving horizon in terms of two Riccati equations with finite discrete jumps.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.135-136
• /
• 2017

When driving at night time environment, the whole body of transports does not visible to us. Due to lack of light conditions, there are only two options, which is clearly visible their taillights and break lights. To improve the recognition correctness of vehicle detection, we present an approach to vehicle detection and tracking using finding contour of the object on binary image at night time. Bilateral filtering is used to make more clearly on threshold part. To remove unexpected small noises used morphological opening. In verification stage, paired tail lights are tracked during their existence in the ROI. The accuracy of the test results for vehicle detection is about 93%.

• The Journal of Korean Association of Computer Education
• /
• v.13 no.4
• /
• pp.77-86
• /
• 2010

In this paper, we propose a real time post-processing visual enhancement technique to reduce the blocking artifacts in block based DCT decoded image for mobile devices that have allocation of the restricted resource. In order to reduce the blocking artifacts effectively even while preserving the image edge to the utmost, the proposed algorithm uses the deblocking filtering or the directional filtering according to the edge detection of the each pixel. After it is discriminated that the pixel to apply the deblocking filtering belongs again to the monotonous area, the weighted average filter with the adaptive mask is applied for the pixel to remove the blocking artifacts. On the other hand, a new directional filter is utilized to get rid of staircase noise and preserve the original edge component. Experimental results show that the proposed algorithm produces better results than those of the conventional algorithms in both subjective and objective qualities.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.887-892
• /
• 2005

Under pure P2P environments, collaborative filtering must be provided with only a few service items by real time information without accumulated data. However, in case of collaborative filtering with only a few service items collected locally, quality of recommended service becomes low. Therefore, it is necessary to research a method to improve quality of recommended service by users' context information. But because a great volume of users' context information can be recognized in a moment, there can be a scalability problem and there are limitations in supporting differentiated services according to fields and items. In this paper, we solved the scalability problem by clustering context information Per each service field and classifying il per each user, using SOM. In addition, we could recommend proper services for users by measuring the context information of the users belonging to the similar classification to the service requester among classified data and then using collaborative filtering.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.2
• /
• pp.184-189
• /
• 2013

In this paper, we propose the injurious moving picture filtering system using certain sounds contained in the injurious moving picture to filter injurious moving picture which is distributed without limitation in internet and internet storage space. For this purpose, the Gaussian Mixture Model which can well represent the characteristics of the sound, is used and frame level likelihood estimation is used to calculate the likelihood between filtering target data and the sound models. Also, the pruning method which can real-time proceed by reducing the comparing number of data, is applied for real-time processing, and MWMR method which showed good performance from existing speaker identification, is applied for the distinguish performance of high precision. In the identification experiment result, in case of the frame rate which is the proportion of total frame to high likelihood frame, is set to 50%, identification error rate is 6.06%, and in case of frame rate is set to 60%, error rate is 3.03%. As the result, the proposed system can distinguish between general and injurious moving picture effectively.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.6
• /
• pp.345-351
• /
• 2014

This paper presents pedestrian recognition to improve performance for vehicle safety system or surveillance system. Pedestrian detection method using HOG (Histograms of Oriented Gradients) has showed 90% recognition rate. But if someone takes a picture in the rain, the image may be distorted by rain streaks and recognition rate goes down by 62%. To solve this problem, we applied image decomposition method using MCA (Morphological Component Analysis). In this case, rain removal method improves recognition rate from 62% to 70%. However, it is difficult to apply conventional image decomposition method using MCA on vehicle safety system or surveillance system as conventional method is too slow for real-time system. To alleviate this issue, we propose a rain removal method by using low-pass filter and DCT (Discrete Cosine Transform). The DCT helps separate the image into rain components. The image is removed rain components by Butterworth filtering. Experimental results show that our method achieved 90% of recognition rate. In addition, the proposed method had accelerated processing time to 17.8ms which is acceptable for real-time system.

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

Median filtering is very effective to remove impulse type noises, so it has been widely used in many signal processing applications. However, due to the time complexity of its non-linearity, median filtering is often used using a small filter window size. A lot of work has been done on devising fast median filtering algorithms, but most of them can be efficiently applied to input data with finite integer values like images. Little work has been carried out on fast 2-d median filtering algorithms that can deal with real-valued 2-d data. In this paper, a fast and simple median 2-d filter is presented, and its performance is compared with the Matlab's 2-d median filter and a heap-based 2-d median filter. The proposed algorithm is shown to be much faster than the Matlab's 2-d median filter and consistently faster than the heap-based algorithm that is much more complicated than the proposed one. Also, a more efficient median filtering scheme for 2-d real valued data with a finite range of values is presented that uses higher-bit integer 2-d median filtering with negligible quantization errors.