• Journal of the Korean Wood Science and Technology
• /
• v.37 no.1
• /
• pp.37-47
• /
• 2009

For the inspection of wood, machine vision is the most common automated inspection method used at present. It is required to sort wood products by grade and to locate surface defects prior to cut-up. Many different sensing methods have been applied to inspection of wood including optical, ultrasonic, X-ray sensing in the wood industry. Nowadays the scanning system mainly employs CCD line-scan camera to meet the needs of accurate detection of lumber defects and real-time image processing. But this system needs exact feeding system and low deviation of lumber thickness. In this study low cost CCD area sensor was used for the development of image processing system for lumber being fed. When domestic red pine being fed on the conveyer belt, lumber images of irregular term of captured area were acquired because belt conveyor slipped between belt and roller. To overcome incorrect image merging by the unstable feeding speed of belt conveyor, it was applied template matching algorithm which was a measure of the similarity between the pattern of current image and the next one. Feeding the lumber over 13.8 m/min, general area sensor generates unreadable image pattern by the motion blur. The red channel of RGB filter showed a good performance for removing background of the green conveyor belt from merged image. Threshold value reduction method that was a image-based thresholding algorithm performed well for knot detection.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.93-101
• /
• 2009

This paper suggests a new algorithm automatically searching for Region-of-Interest(ROI) with high speed, using the edge information of high frequency subband transformed with wavelet. The proposed method executes a searching algorithm of 4-direction object boundary by the unit of block using the edge information, and detects ROIs. The whole image is splitted by $64{\times}64$ or $32{\times}32$ sized blocks and the blocks can be ROI block or background block according to taking the edges or not. The 4-directions searche the image from the outside to the center and the algorithm uses a feature that the low-DOF image has some edges as one goes to center. After searching all the edges, the method regards the inner blocks of the edges as ROI, and makes the ROI masks and sends them to server. This is one of the dynamic ROI method. The existing methods have had some problems of complicated filtering and region merge, but this method improved considerably the problems. Also, it was possible to apply to an application requiring real-time processing caused by the process of the unit of block.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.607-611
• /
• 2008

This paper proposes new video signature using spatio-temporal information for copy detection. The proposed video copy detection method is based on concentric circle partitioning method for each key frame. Firstly, key frames are extracted from whole video using temporal bilinear interpolation periodically and each frame is partitioned as a shape of concentric circle. For the partitioned sub-regions, 4 feature distributions of average intensity, its difference, symmetric difference and circular difference distributions are obtained by using the relation between the sub-regions. Finally these feature distributions are converted into binary signature by using simple hash function and merged together. For the proposed video signature, the similarity distance is calculated by simple Hamming distance so that its matching speed is very fast. From experiment results, the proposed method shows high detection success ratio of average 97.4% for various modifications. Therefore it is expected that the proposed method can be utilized for video copy detection widely.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.526-534
• /
• 2010

This paper describes an algorithm which merges two HDR pictures taken under different exposure time to display on the LDR devices such as LCD or CRT. The proposed method does not generate the radiance map, but directly merges using the weights computed from the input images. The weights are firstly produced on the pixel basis, and then blended with a Gaussian function. This process prevents some possible sparkle noises caused by radical change of the weights and contributes to smooth connection between 2 image informations. The chrominance informations of the images are merged on the weighted averaging scheme using the deviations of RGB average and their differences. The algorithm is characterized by the feature that it represents well the unsaturated area of 2 original images and the connection of the image information is smooth. The proposed method uses only 2 input images and automatically tunes the whole internal process according to them, thus autonomous operation is possible when it is included in HDR cameras which use double shuttering scheme or double sensor cells.

• The Journal of the Korea Contents Association
• /
• v.20 no.5
• /
• pp.338-343
• /
• 2020

This paper provides a semantic account of double nominative constructions in the framework of Autolexical Grammar, which views syntax, semantics, morphology, and other language components as modules generated simultaneously and independently. Some syntactocentric models in the past analyzed double nominatives as a result of possessor raising, ECM or incorporation. This paper provides a semantic explication of double nominatives through function-argument (F/A) structure of internal possession and external possession. The possessum used in double nominatives is a relational noun which takes a possessor as its argument in F/A structure. If the possessor directly combines with the relational noun, then internal possession is generated. If the possessor is a gap in F/A structure, then the argument which is coreferential with the gap combines later with the predicate, resulting in external possession, in which the possessor is in the nominative case. Unlike internal possession, the F/A structure of external possession structurally shows that the sentence is predicated of the possessor.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.44-53
• /
• 2011

In this paper, we propose a 3D conversion algorithm of 2D video using depth layer partition method. In the proposed algorithm, we first set frame groups using cut detection algorithm. Each divided frame groups will reduce the possibility of error propagation in the process of motion estimation. Depth image generation is the core technique in 2D/3D conversion algorithm. Therefore, we use two depth map generation algorithms. In the first, segmentation and motion information are used, and in the other, edge directional histogram is used. After applying depth layer partition algorithm which separates objects(foreground) and the background from the original image, the extracted two depth maps are properly merged. Through experiments, we verify that the proposed algorithm generates reliable depth map and good conversion results.

• Journal of Korea Spatial Information System Society
• /
• v.4 no.1 s.7
• /
• pp.39-46
• /
• 2002

In distributed spatial database systems, users nay issue a query that joins two relations stored at different sites. The sheer volume and complexity of spatial data bring out expensive CPU and I/O costs during the spatial join processing. This paper shows a new spatial join method which joins two spatial relation in a parallel way. Firstly, the initial join operation is divided into two distinct ones by partitioning one of two participating relations based on the region. This two join operations are assigned to each sites and executed simultaneously. Finally, each intermediate result sets from the two join operations are merged to an ultimate result set. This method reduces the number of spatial objects participating in the spatial operations. It also reduces the scope and the number of scanning spatial indices. And it does not materialize the temporary results by implementing the join algebra operators using the iterator. The performance test shows that this join method can lead to efficient use in terms of buffer and disk by narrowing down the joining region and decreasing the number of spatial objects.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.126-134
• /
• 2011

Recently, many researchers are interested in using join queries to correlate sensor readings stored in different regions. In the conventional algorithm, the preliminary join coordinator collects the synopsis from sensor nodes and determines a set of sensor readings that are required for processing the join query. Then, the base station collects only a part of sensor readings instead of whole readings and performs the final join process. However, it has a problem that incurs communication overhead for processing the preliminary join. In this paper, we propose a novel energy-efficient in-network join scheme that solves such a problem. The proposed scheme determines a preliminary join coordinator located to minimize the communication cost for the preliminary join. The coordinator prunes data that do not contribute to the join result and performs the compression of sensor readings in the early stage of the join processing. Therefore, the base station just collects a part of compressed sensor readings with the decompression table and determines the join result from them. In the result, the proposed scheme reduces communication costs for the preliminary join processing and prolongs the network lifetime.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.3
• /
• pp.684-689
• /
• 2005

In this paper, we propose car license plate recognition using morphological information and an enhanced neural network. Morphological information on horizontal and vertical edges was used to extract the license plate from a car image. We used a contour tracking algorithm combined with the method of histogram and location information to extract individual characters in the extracted plate. The enhanced neural network is proposed for recognizing them, which has the method of combining the ART-1 and the supervised teaming method. The proposed method has applied to real world car images. The experimental results show that the proposed method has better the extraction rates than the methods with information of the thresholding, the RGB and the HSI, respectively. And the proposed neural network has better recognition performance than the conventional neural networks.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.185-195
• /
• 2013

In this paper, we propose a video summarization technique on a smartphone, based on spatiotemporal saliency. The proposed technique detects scene changes by computing the difference of the color histogram, which is robust to camera and object motion. Then the similarity between adjacent frames, face region, and frame saliency are computed to analyze the spatiotemporal saliency in a video clip. Over-segmented hierarchical tree is created using scene changes and is updated iteratively using mergence and maintenance energies computed during the analysis procedure. In the updated hierarchical tree, segmented frames are extracted by applying a greedy algorithm on the node with high saliency when it satisfies the reduction ratio and the minimum interval requested by the user. Experimental result shows that the proposed method summaries a 2 minute-length video in about 10 seconds on a commercial smartphone. The summarization quality is superior to the commercial video editing software, Muvee.