Search

Automatic landmine detection system using ground penetrating radar has been widely researched. For the automatic mine detection system, system speed is an important factor. Many techniques for mine detection have been developed based on statistical background. Among them, a detection technique employing the Principal Component Analysis(PCA) has been used for clutter reduction and anomaly detection. However, the PCA technique can retard the entire process, because of large basis dimension and a numerous number of inner product operations. In order to overcome this problem, we propose a fast anomaly detection system using 2D DCT and PCA. Our experiments use a set of data obtained from a test site where the anti-tank and anti- personnel mines are buried. We evaluate the proposed system in terms of the ROC curve. The result shows that the proposed system performs much better than the conventional PCA systems from the viewpoint of speed and false alarm rate.

Display adaptation is one of the key factors for the success of visual services. For two-dimensional (2D) imaging, the display adaptation is generally accomplished by 2D image re-sampling (i.e., up-/down-sampling). However, when it comes to stereoscopic three-dimensional (S3D) images, 2D re-sampling methods are inadequate because additional consideration on the third dimension of depth is not incorporated. In this paper, we analyze S3D image resizing from two aspects: geometrical deformation and frequency-domain aliasing. A number of S3D displays are available in the market and they have various screen dimensions. As we have more varieties of the displays, efficient S3D image resizing is becoming more emphasized. We present the conditions for equi-proportional S3D image resizing using the model of the binocular vision; and propose an anti-aliasing filter for stereoscopic 3D image up/down-sampling.

Burst error is the most difficult problem to cope with in a wireless video transmission. In this paper, a new robust coding method is proposed, which is based on the spreading of burst error. We propose a coefficient sampling method for spreading, and show a projections onto convex sets (POCS) method fits well into this coefficient sampling method as a restoration method. The simulation results show that the proposed method restores the lost information very well.© (2000) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

In this work, we present a novel method for bit allocation problem that aims to minimize overall distortion subject to bit rate constraint. It has been proved that optimal solution can be found by a method using the Lagrangian method with dynamic programming. However, the optimal bit allocation for block-based interframe coding is practically unattainable because of interframe dependency of macroblocks caused by motion compensation. In order to reduce the computational burden maintaining the result close to optimal, we propose an alternative method. We derive a partitioned form of the bit allocation problem: a frame-level problem and one-frame macroblock-level problems. Then we use a two-phase optimization technique with an interframe dependency model and a rate-distortion model.© (1998) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

In this paper, we propose a novel moving target extraction algorithm for selective coding whichdoes discriminately encode target from background region in a general tactical scene. Our algo- rithm have 4 stages. In first stage, we perform global motion estimation and compensation. Innext stage, we segment the motion vector field using region growing technique. After that, wecalculate the change detection mask which is a set of changed regions. Finally, we extract the moving target(s) by using the motion segmentation information and the change detection maskobtained from the previous stages. Simulation results show that our algorithm have better resultthan the existing methods for tactical scenes. Keywords : Target Extraction, Selective Coding, Motion Field Segmentation, Region Segmentation 1 INTRODUCTION Until now, many algorithms34 have been proposed for moving object segmentation which are very imp itantfor object oriented video coding. Among them, there are two key algorithms of which one is a method proposed

MASF(Motion Adaptive Spatial Filter) is a kind of temporal filter proposed for noise reductionand temporal band limitation. MASF uses motion vectors to extract the temporal informationin spatial domain. Therefore, inaccurate motion information causes some distortions in MASFoperation. In order to decrease the distortions, motion correcting techniques are required.In this paper, we analyse the effect of motion estimation error on MASF and propose a motionestimation scheme including motion correction and quantization for MASF. Experimental resultsshow that by using the proposed scheme considerable amounts of distortions are eliminated. Keywords : Motion Adaptive Spatial Filter, temporal filter, look-up table 1 INTRODUCTION Until now, most temporal filters in the literature have been proposed only for temporal noise 2 3 Thisis caused by the fact that the implementation of temporal filter arises many problems such as high implementationcost(i.e. many frame memories), considerable processing delay, and so forth.Recently, one solution called MASF using the motion vectors instead of temporal data was proposed by Kimet al.4 MASF is a kind of temporal filter proposed for noise reduction and temporal band limitation. MASF hasfilter coefficients in the spatial domain whose values are changed according to the motion vector. Since MASF

This paper describes a method of coding image sequences based on global/local motion information. The suggested method initially estimates global motion parameters and local motion vectors. Then segmentation is performed with a hierarchial clustering scheme and a quadtree algorithm in order to divide a processing image into the background and target region. Finally image coding is done by assigning more bits to the target region and less bits to background so that the target region may be reconstructed with high quality. Simulations show that the suggested algorithm performs well especially in the circumstances where background changes and target region is small enough compared with that of background.© (1995) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.