• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.167-170
• /
• 2000

In this paper, we present a fast algorithm for the motion estimation using the efficient selection of an initial search position. In the method, we select the initial search position using the motion vector from the subsmpled images, the predicted motion vector from the neighbor blocks, and the (0,0) motion vector. While searching the candidate blocks, we use the spiral search pattern with the successive elimination algorithm(SEA) and the partial distortion elimination(PDE). The experiment results show that the complexity of the proposed algorithm is about 2∼3 times faster than the three-step search(TSS) with the PSNR loss of just 0.05［dB］∼0.1［dB］ than the full search algorithm PSNR. The search complexity can be reduced with quite a few PSNR loss by controling the number of the depth in the spiral search pattern.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.339-342
• /
• 2005

We present an efficient block-based motion estimation algorithm with motion analysis. The motion analysis determines a size of search pattern and a maximum repeated count of search pattern. In case of large movement in large image, we reduce search points and the local minimum which caused by low performance. The proposed algorithm employs with searching step of 2. The first step determines an initial search point with neighbor block vector and a size of initial search pattern. The second step determines a size of search pattern and a maximum repeated count with motion analysis. We improve motion prediction accuracy while reducing required computational complexity compared to other fast block-based motion estimation algorithms.

• Bulletin of the Korean Chemical Society
• /
• v.24 no.6
• /
• pp.733-738
• /
• 2003

Linear scaling quantum theories are reviewed especially focusing on the method adopted in GAMESS. The three key translation equations of the fast multipole method (FMM) are deduced from the general polypolar expansions given earlier by Steinborn and Ruedenberg. Simplifications are introduced for the rotation-based FMM that lead to a very compact FMM formalism. The OPS (optimum parameter searching) procedure, a stable and efficient way of obtaining the optimum set of FMM parameters, is established with complete control over the tolerable error ε. In addition, a new parallel FMM algorithm, requiring virtually no inter-node communication, is suggested which is suitable for the parallel construction of Fock matrices in electronic structure calculations.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.63-67
• /
• 2004

The conventional typical techniques as fast codebook generation methods are PDS, FNNS, and FC. In this paper, we propose FCNNPDS integrated the conventional methods to generate a codebook. The results of simulations show that the computational magnitude of FCNNPDS is reduced to 40-95% lower than conventional techniques. But comparison computation has no relation with k dimension of vectors, that is, because the computational magnitude of comparison is smaller than others, therefore FCNNPDS may be the best method than the conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.461-468
• /
• 2000

Amounts of audio data used in several computer application have necessitated the development of audio database systems with newer features such as content-based queries and similarity searches to manage and use such data. Fast and accurate retrievals for content-based queries are crucial for such systems to be useful. Efficient content-based indexing and similarity searching schemes are keys to providing fast and relevant data retrievals. This paper present a method for indexing of Korean Traditional Music audio data based on wavelets. Also this paper present possibility of wavelet based audio indexing.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.857-858
• /
• 2008

This paper proposes a new fast algorithm that detects the lanes on the road using Moore-Neighbor edge trace algorithm, which traces the edge elements by searching the connectivity in eight direction window. The detected line components are connected if they have the same orientation on the same line. The proposed algorithm is faster than other conventional algorithms since it tests only the connectivities of the line segments. The performance of the proposed algorithm has tested by the experiments to test how fast and accurate.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.904-907
• /
• 2002

In this paper, we describe an algorithm to automatically generate an intermediate scene using the bidirectional disparity morphing from the parallel stereopair. To compute the disparity between two reference images, we use the 2-step fast block matching algorithm that restricts the searching range and accelerates the speed of the computation of the disparity. We also define three occluding patterns so as to smooth the computed disparities, especially for occluded regions. They are derived from the peculiar properties of the disparity map. The smoothed disparity maps present that the false disparities are well corrected and the boundary between foreground and background becomes sharper. We discuss the advantages of this algorithm compared to the commonly used schemes and we show some experimental results with real data.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.84-101
• /
• 1997

Inferring and recognizing 3D objects form a 2D occuluded image has been an important research area of computer vision. The octree model, a hierarchical volume description of 3D objects, may be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition. We present a fast algorithm of finding the 4 pairs of feature points to estimate the viewing direction. The method is based on matching the object contour to the reference occuluded shapes of 49 viewing directions. The initially best matched viewing direction is calibrated by searching for the 4 pairs of feature points between the input image and the image projected along the estimated viewing direction. Then the input shape is recognized by matching to the projectd shape. The computational complexity of the proposed method is shown to be O(n$^{2}$) in the worst case, and that of the simple combinatorial method is O(m$^{4}$.n$^{4}$) where m and n denote the number of feature points of the 3D model object and the 2D object respectively.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.126-128
• /
• 2006

For pattern matching, an object image should be segmented and analyzed for the first time. Thresholding is a fundamental approach to segmentation that utilizes a significant degree of pixel popularity or intensity. Otsu's thresholding is one of the most veil-known methods proposed in the literature. However, the method has a disadvantage of repeatedly searching the optimal thresholds for the entire region. To overcome this problem, a number of methods have been proposed. In this paper, we propose a simple and fast thresholding method of finding multi-level threshold values by extending the Otsu's method. Our experimental results for the benchmak images show a possibility that the proposed method could be used efficiently for pattern matching.

• International journal of advanced smart convergence
• /
• v.5 no.4
• /
• pp.1-9
• /
• 2016

In order to reconstruct a 3D model in video sequences, to select key frames that are easy to estimate a geometric model is essential. This paper proposes a method to easily extract informative frames from a handheld video. The method combines selection criteria based on appropriate-baseline determination between frames, frame jumping for fast searching in the video, geometric robust information criterion (GRIC) scores for the frame-to-frame homography and fundamental matrix, and blurry-frame removal. Through experiments with videos taken in indoor space, the proposed method shows creating a more robust 3D point cloud than existing methods, even in the presence of motion blur and degenerate motions.