• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.1 s.343
• /
• pp.71-78
• /
• 2006

An NoC (Networks-on-Chip) is an emerging design paradigm intended to cope with a future SoC containing numerous built-in cores. In an NoC, the test strategy is very significant for its practicality and feasibility. Among existing test issues, TAM architecture and test scheduling will particularly dominate the overall test performance. In this paper, we address an efficient NoC test scheduling algorithm based on a rectangle packing approach used for an SoC test. In order to adopt the rectangle packing solution as an NoC test scheduling algorithm we design the configuration about test resources and test methods suitable for an NoC structure. Experimental results using some ITC'02 benchmark circuits show the proposed algorithm can reduce the overall test time by up to $55\%$ in comparison with previous works.

• Journal of Korea Multimedia Society
• /
• v.14 no.4
• /
• pp.538-545
• /
• 2011

Today, there is a wide variety of digital contents on the Internet. Especially, comic images are one of popular digital contents. Most of them are scanned from comic books by digital scanners, but they were not normalized in sense of their size, skew and boundary margin. The normalization is very important step in comic image analysis. It can be achieved by finding out-boundary rectangles in comic images. In this paper, we propose a method for detecting the out-boundary rectangle using the gradient Radon transform in comic images. We applied the Radon transform using image gradients to extract line segments which are the out-boundary rectangle sides' candidates in comic images. The final out-boundary rectangle can be detected by local histogram and the candidate line segments. Experimental results show that our proposed method effectively detect the out-boundary rectangle in comic images.

• Kyungpook Mathematical Journal
• /
• v.48 no.2
• /
• pp.331-335
• /
• 2008

In this paper, we investigate the number of ones in rows of Pascal's Rectangle. Using these results, we determine the existence of regular bipartite Steinhaus graphs. Also, we give an upper bound for the minimum degree of bipartite Steinhaus graphs.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.2
• /
• pp.112-117
• /
• 1989

This paper describes to the unit rectangle EB direct writing lithography method using SEM. This method has the constant exposure time to any rectangle pattern. In order to change the EB current according to various rectangle size for the constant exposure time, the supply current of condenser lens in controlled by BITMAP-IV CAD system. By this method, the resizing procedure of density pattern area is not needed to pattern data conversion, and the through-put ofr exposure is increased about 172 times compared with the unit scan exposure method.

• Journal of Ubiquitous Convergence Technology
• /
• v.1 no.1
• /
• pp.9-17
• /
• 2007

Feature based stereo matching is an effective way to perform 3D building reconstruction. However, in urban scene, the cluttered background and various building structures may interfere with the performance of building reconstruction. In this paper, we propose a novel method to robustly reconstruct buildings on the basis of rectangle regions. Firstly, we propose a multi-scale linear feature detector to obtain the salient line segments on the object contours. Secondly, candidate rectangle regions are extracted from the salient line segments based on their local information. Thirdly, stereo matching is performed with the list of matching line segments, which are boundary edges of the corresponding rectangles from the left and right image. Experimental results demonstrate that the proposed method can achieve better accuracy on the reconstructed result than pixel-level stereo matching.

• Journal of radiological science and technology
• /
• v.41 no.3
• /
• pp.249-254
• /
• 2018

In this study, we evaluated the DAP(Dose Area Product) reduction effect of the newly developed IRIS collimator by measuring the DAP of the Rectangle collimator and the IRIS collimator depending on the field, SID(Source to Image recpetor Distance) change, and AEC mode use. The results were as follows. The IRIS collimator decreased DAP by 34.91, 29.33, and 29.04%, respectively, compared to the Rectangle collimator when the field was increased to $8{\times}8$, $12{\times}12$, $16{\times}16inch$. And also, when the SID was increased to 100, 120 and 140 cm, the IRIS collimator decreased DAP by 10.73, 33.68 and 46.22%, respectively, compared to the Rectangle collimator. In AEC mode and none-AEC mode, DAP in IRIS collimator was reduced by 32.71 and 21.69%, respectively, compared with the Rectangle type. The IRIS collimator can reduce DAP by 29.62% on average compared to Rectangle type, which is statistically significant. These results suggest that the newly developed IRIS collimator can be used in medical field to alleviate radiation exposure.

• School Mathematics
• /
• v.9 no.1
• /
• pp.13-28
• /
• 2007

Division of fractions can be categorized as measurement division, partitive or sharing division, the inverse of multiplication, and the inverse of Cartesian product. Division algorithm for fractions has been interpreted with manipulative aids or models mainly in the contexts of measurement division and partitive division. On the contrary, there are few interpretations for the context of the inverse of a Cartesian product. In this paper the significance and the limits of existing interpretations of division of fractions in the context of the inverse of a Cartesian product were discussed. And some new easier interpretations of division algorithm in the context of a Cartesian product are developed. The problem to determine the length of a rectangle where the area and the width of it are known can be solved by various approaches: making the width of a rectangle be equal to one, making the width of a rectangle be equal to some natural number, making the area of a rectangle be equal to 1. These approaches may help students to understand the meaning of division of fractions and the meaning of the inverse of the divisor. These approaches make the inverse of a Cartesian product have many merits as an introductory context of division algorithm for fractions.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.343-350
• /
• 2005

In this paper we prove two results about tilings of orthogonal polygons. (1) P be an orthogonal polygon with rational vertex coordinates and let R(u) be a rectangle with side lengths u and 1. An orthogonal polygon P can be tiled with similar copies of R(u) if and only if u i algebraic and the real part of each of its conjugates is positive; (2) Laczkovich proved that if a triangle $\Delta$ tiles a rectangle then either $\Delta$ is a right triangle or the angles of $\Delta$ are rational multiples of $\pi$. We generalize the result of Laczkovich to orthogonal polygons.

• Proceedings of the ESK Conference
• /
• 1995.04a
• /
• pp.181-186
• /
• 1995

This study investigated the effects of several factors - stimulus color, background color, and predicted depth - that affect depth perception in stereoscopic displays. For this study, two experiments were conducted; in the first experiment, the subjects were asked to indicate the depth perceived from presented image(rectangle) using matching mark, and in the second experiment, the subjects were asked to adjust one image(controllable rectangle) to have the same perceived depth as the other image(fixed rectangle) using keyboard. The depth perceived under various combination of levels of these factors was compared with depth predicted by the geometry of streopsis. Through two experiments, we found that stimulus color, predicted depth, and interaction between stimulus color and background color affected perceived depth significantly, and that red was perceived to be closest to the observer followed by yellow, green, and then blue.

• International Journal of Contents
• /
• v.9 no.1
• /
• pp.6-10
• /
• 2013

Foreground estimation in object segmentation has been an important issue for last few decades. In this paper we propose a GrabCut based automatic foreground estimation method using block clustering. GrabCut is one of popular algorithms for image segmentation in 2D image. However GrabCut is semi-automatic algorithm. So it requires the user input a rough boundary for foreground and background. Typically, the user draws a rectangle around the object of interest manually. The goal of proposed method is to generate an initial rectangle automatically. In order to create initial rectangle, we use Gabor filter and Saliency map and then we use 4 features (amount of area, variance, amount of class with boundary area, amount of class with saliency map) to categorize foreground and background. From the experimental results, our proposed algorithm can achieve satisfactory accuracy in object segmentation without any prior information by the user.