• Journal of KIISE:Software and Applications
• /
• v.32 no.9
• /
• pp.878-887
• /
• 2005

The passive focusing method finds the in-focus position by analyzing images captured by a camera. In this paper, we propose an efficient passive auto-focusing algorithm for video measuring systems. The sum of modified Laplacian of Gaussian is used to calculate focus values from images and Gaussian curve fitting is applied to estimate the optimal in-focus position. The Proposed method is tested for various objects and illuminations. The test result is compared with other methods to verify accuracy and efficiency of the proposed algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.83-86
• /
• 2010

본 논문에서는 시공간 데이터 스트림에서 관심 이벤트를 검출할 수 있고 복잡한 공간 패턴을 감지할 수 있는 시공간 복합 이벤트 처리 시스템을 제안한다. 제안 시스템은 이동 객체 및 정적 객체에서 발생하는 시공간 데이터 스트림에서 스트림 발생시각, 위치 정보와 같은 시공간 정보를 데이터베이스와의 조인을 통해 얻은 관련 속성 정보를 활용하여 이벤트를 검출할 수 있다. 또한, 시공간 정보가 포함된 복잡한 패턴을 처리하기 위해 공간 패턴 연산자를 사용하여 시공간 복합 이벤트를 처리할 수 있다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.11
• /
• pp.56-65
• /
• 2016

In this paper, in order to reduce the delay and area of the partial product accumulation (PPA) of the parallel decimal multiplier, a tree architecture that composed by multi-operand decimal CSAs and improved CLA is proposed. The proposed tree using multi-operand CSAs reduces the partial product quickly. Since the input range of the recoder of CSA is limited, CSA can get the simplest logic. In addition, using the multi-operand decimal CSAs to add decimal numbers that have limited range in specific locations of the specific architecture can reduce the partial products efficiently. Also, final BCD result can be received faster by improving the logic of the decimal CLA. In order to evaluate the performance of the proposed partial product accumulation, synthesis is implemented by using Design Complier with 180 nm COMS technology library. Synthesis results show the delay of the proposed partial product accumulation is reduced by 15.6% and area is reduced by 16.2% comparing with which uses general method. Also, the total delay and area are still reduced despite the delay and area of the CLA are increased.

• The KIPS Transactions:PartD
• /
• v.13D no.5 s.108
• /
• pp.641-650
• /
• 2006

XML has the characteristics of self-describing and uses DTD or XML schema in order to constraint its structure. Even though the XML schema is only at the stage of recommendation yet, it will be prevalently used because DTD is not itself XML and has the limitation on the expression power. The structure defined by the XML schema as well as the data of the XML documents can vary due to complex reasons. Those reasons are errors in the XML schema design, new requirements due to new applications, etc. Thus, we propose XML schema evolution operators that are extracted from the analysis of the XML schema updates. These schema evolution operators enable the XML schema updates that would have been impossible without supporting tools if there are a large number of XML documents complying the U schema. In addition, these operators includes the function of automatically finding the update place in the XML documents which are registered to the XSE system, and maintaining the XML documents valid to the XML schema rather than merely well-formed. This paper is the first attempt to update XML schemas of the XML documents and provides the comprehensive set of schema updating operations. Our work is necessary for the XML application development and maintenance in that it helps to update the structure of the XML documents as well as the data in the easy and precise manner.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.2
• /
• pp.50-59
• /
• 2000

In this paper, a new preprocessing method is proposed to speedup the watershed-based image segmentation In the proposed method, the gradient correction values of ramp edges are calculated from the positions and width of the ramp edges using Laplacian operator, and then, unlike the conventional method in which the monoscale or multi scale gradient image is directly used as a reference iImage, the reference image is obtained by adding the threshold value to each position of the ramp edges in the monoscale gradient image And the marker image is reconstructed on the reference image by erosion By preprocessing the image for the watershed transformation in such a manner, we can reduce the oversegmentations far more than those of applying the conventional morphological filter to the simple monoscale or multiscale gradient-based reference image Thus, we can reduce the total image segmentation time by reducing the time of postprocessing of region merging, which consumes most of the processing time In the watershed-based image segmentation, Experimental results indicate that the proposed method can speedup the total image segmentation about twice than those of the conventional methods, without the loss of ramp edges and principal edges around the dense-edge region.

• The KIPS Transactions:PartB
• /
• v.12B no.1 s.97
• /
• pp.17-24
• /
• 2005

In this paper, we will show that a control search methodology is a alternative method of a sequential search which is difficult in finding books for arrangement at library or a bookstore when books are out of place. To solve the problem of the sequential search, we apply a edge operator and the Hough Transform to boundary of a taken photograph image book. We generate histogram by a projected image from boundary range of selected books and select title areas from this and possible areas which are a character number of title, authors, a publishing company and an array sequence. Finally, we can select the final possible area of a book location by a curve fitting and a regression line extraction, and show utility through experiment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8C
• /
• pp.583-590
• /
• 2008

In this paper, we present a spatially adaptive post-processing algorithm for H.264 video coding standard to remove blocking artifacts. The loop filter of H.264 increases computational complexity of the encoder. Furthermore it doesn't clearly remove the blocking artifacts, resulting in over-blurring. For overcoming them, we combine the projection method with the Constraint Least Squares(CLS) method to restore the high quality image. To reflect the Human Visual System, we adopt the weight norm CLS method. Particularly pixel location-based local variance and laplacian operator are newly defined for the CLS method. In addition, the fact that correlation among adjoining pixels is high is utilized to constrain the solution space when the projection method is applied. Quantization Index(QP) of H.264 is also used to control the degree of smoothness. The simulation results show that the proposed post-processing filter works better than the loop filter of H.264 and converges more quickly than the CLS method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.8
• /
• pp.55-67
• /
• 1998

This paper presents an automatic facial feature point extraction algorithm in sequential color images. To extract facial region in the video sequence, a moving color detection technique is proposed that emphasize moving skin color region by applying motion detection algorithm on the skin-color transformed images. The threshold value for the pixel difference detection is also decided according to the transformed pixel value that represents the probability of the desired color information. Eye candidate regions are selected using both of the black/white color information inside the skin-color region and the valley information of the moving skin region detected using morphological operators. Eye region is finally decided by the geometrical relationship of the eyes and color histogram. To decide the exact feature points, the PCA(Principal Component Analysis) is used on each eye and mouth regions. Experimental results show that the feature points of eye and mouth can be obtained correctly irrespective of background, direction and size of face.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.1
• /
• pp.75-85
• /
• 1985

We have studied on the 2-D moving target tracking algorithm satisfying a real-time hardware implementation requirement. In this paper, a fast algorithm is developed based on the operator formulation and the variational algorithm f 10] . Here, we use the directed search for the maximum of the cross-correlation in order to obtain an initial estimate for the variational algorithm and decompose the scene into 16 smaller subblocks and apply the variational algorithm to each subblock sequentially with a new moving area detection method. We call the algorithm subblock based recursive algorithm. Compared with (10) , the ratio of the computational savings obtained from the proposed algorithm is 7 on the average.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.230-232
• /
• 2011

Owing to the advent of digital devices which equipped with GPS, such as smartphone and tablet pc, a number of LBSNS applications have been released and even SNS applications serve various Location-Based Services. In twitter's case, the news of interesting area is provided to user not by being subscribed them automatically, but by being searched on web-site. This paper describes the system designed for users want to subscribe the local news without procedure like searching using operators. This system uses PBSM(Partition Based Spatial-Merge Join) which has no index for batch processing and against a massive query. The results from Spatial Join are stored in Materialized View then provided to user.