• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2393-2396
• /
• 2005

We present a method to detect on-road vehicle using geometric invariant of feature points on side planes of the vehicle. The vehicles are assumed into a set of planes and the invariant from motion information of features on the plane segments the plane from the theory that a geometric invariant value defined by five points on a plane is preserved under a projective transform. Harris corners as a salient image point are used to give motion information with the normalized correlation centered at these points. We define a probabilistic criterion to test the similarity of invariant values between sequential frames. Experimental results using images of real road scenes are presented.

• Journal of Chest Surgery
• /
• v.15 no.3
• /
• pp.338-345
• /
• 1982

An 11 year old boy with a preductal coarctation and a patent ductus arteriosus underwent ligation of the ductus and patch aortoplasty for correction of the coarctation. His postoperative course was complicated by a paradoxical hypertension and a transient mesenteric arteritis syndrome which were successfully managed with sodium nitroprusside, propranolol and hydralazine. His urine catecholamine tests were markedly elevated one week after the operation which returned to normal 4 days later. Some of the salient points ~n the pathogenesis and management of these problems are discussed.

• KIEE International Transactions on Electrophysics and Applications
• /
• v.5C no.2
• /
• pp.67-71
• /
• 2005

Cable failure investigations must evaluate all facets of cable technology to reach a complete understanding of why and how an underground power cable failed. This paper presents the salient points of a recent investigation into an in-service failure after only several weeks of operation.

• Journal of Digital Convergence
• /
• v.10 no.8
• /
• pp.211-217
• /
• 2012

Conventional GrabCut algorithm is semi-automatic algorithm that user must be set rectangle window surrounds the object. This paper studied automatic object detection to solve these problem by detecting salient region based on Human Visual System. Saliency map is computed using Lab color space which is based on color opposing theory of 'red-green' and 'blue-yellow'. Then Saliency Points are computed from the boundaries of Low-Frequency region that are extracted from Saliency Map. Finally, Rectangle windows are obtained from coordinate value of Saliency Points and these windows are used in GrabCut algorithm to extract objects. Through various experiments, the proposed algorithm computing rectangle windows of salient region and extracting objects has been proved.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.2
• /
• pp.48-55
• /
• 2008

In this paper we propose a novel method for image retrieval system using image segmentation and salient points. The proposed method consists of four steps. In the first step, images are segmented into several regions by JSEG algorithm. In the second step, for the segmented regions, dominant colors and the corresponding color histogram are constructed. By using dominant colors and color histogram, we identify candidate regions where objects may exist. In the third step, real object regions are detected from candidate regions by SIFT matching. In the final step, we measure the similarity between the query image and DB image by using the color correlogram technique. Color correlogram is computed in the query image and object region of DB image. By experimental results, it has been shown that the proposed method detects multi-object very well and it provides better retrieval performance compared with object-based retrieval systems.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1484-1490
• /
• 2007

The Cross Reference Point(CRP) is a robust method for finding salient points in watermarking systems because it is based on the geometrical structure of a normalized image in order to avoid pointing error caused by digital attacks. After normalization of an image, the 100 CRPs are calculated. Next, the 100 blocks centered by CRPS are formed. These 100 blocks are arranged using a secrete key. Each boundary of 50 out of 100 blocks is surrounded by 8 blocks which are selected by the ordered number of a preceding block. This number is a seed of random number generator for selecting 8 out of 50 blocks. The search area of a center block is formed by a secrete key. The pixels of a center block are quantized to 10 levels by predefined thresholds. The watermarks are generated by the 50 quantized center blocks. These watermarks are embedded directly in the remaining 50 blocks. In other words, 50 out of 100 blocks are utilized to generate watermarks and the remaining 50 blocks are used to watermark embedding. Because the watermarks are generated in the given images, we can successfully detect watermarks after several digital attacks. The reason is that the blocks for the generation and detection of watermarks are equally affected by digital attacks except for the case of local distortion such as cropping.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1843-1859
• /
• 2013

The continuous increase of the spatial resolution of remote sensing images brings great challenge to image analysis and processing. Traditional prior knowledge-based region detection and target recognition algorithms for processing high resolution remote sensing images generally employ a global searching solution, which results in prohibitive computational complexity. In this paper, a more efficient region of interest (ROI) detection algorithm based on visual attention and threshold segmentation (VA-TS) is proposed, wherein a visual attention mechanism is used to eliminate image segmentation and feature detection to the entire image. The input image is subsampled to decrease the amount of data and the discrete moment transform (DMT) feature is extracted to provide a finer description of the edges. The feature maps are combined with weights according to the amount of the "strong points" and the "salient points". A threshold segmentation strategy is employed to obtain more accurate region of interest shape information with the very low computational complexity. Experimental statistics have shown that the proposed algorithm is computational efficient and provide more visually accurate detection results. The calculation time is only about 0.7% of the traditional Itti's model.

• Korean Journal of Child Studies
• /
• v.28 no.4
• /
• pp.245-264
• /
• 2007

This study analyzed physical knowledge displayed in the utterances of 10 Korean children 23 - 76 months of age. Utterances were blocked into four-month time periods, except the first two months and classified into 5 categories including properties of physical objects and materials, friction, buoyancy, gravity, and the motion of physical objects. All five types of physical expressions were found in the data of the earliest period the percent age of the properties and motion was higher than the percent of friction, buoyancy, and gravity. Data suggested two transitional points of change in physical knowledge : 2-year-old's descriptions were based only on perceptually salient physical features 3- to 4-year-olds described only end-state results while children older than 4 included systematic causality.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.179-182
• /
• 2003

This paper proposes a new stereo matching algorithm using both the divide-and-conquer method and the DSI(Disparity Space Image) technique. Firstly, we find salient feature points on the each scanline of the left image and find the corresponding feature point at the right image. Then the problem of a scanline is divided into several subproblems. By this way, matching of the subintervals is implemented by using the DSI technique. The DSI technique for stereo matching process is a very efficient solution to find matches and occlusions simultaneously and it is very speedy. In addition, we apply three occluding patterns to process occluded regions, as a result, we reduce mismatches at the disparity discontinuity.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.126-135
• /
• 2007

We propose and test several computational methods to automatically determine possible saliency cut-off points in Sketch Engine (Kilgarriff and Tugwell, 2001). Sketch Engine currently displays collocations in descending importance, as well as according to grammatical relations. However, Sketch Engine does not provide suggestions for a cut-off point such that any items above this cut-off point may be considered significantly salient. This proposal suggests improvement to the present Sketch Engine interface by calculating three different cut-off point methods, so that the presentation of results can be made more meaningful to users. In addition, our findings also contribute to linguistic analyses based on empirical data.