• Title/Summary/Keyword: Triangle set

Search Result 85, Processing Time 0.026 seconds

Nonorthogonal Basis Functions to Signal Processing (Nonorthogonal 기본함수의 신호처리)

  • 안성렬;이문호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.10 no.1
    • /
    • pp.31-37
    • /
    • 1985
  • An interesting area of application which makes use of the unique features of the walsh series is that on non-linear stochastic problems. In particular, some success has been obtained in improving the efficiency of signal detection for those transducers which are essentially non-linear in operation. The set of harmonically-related nonorthogonal triangle waves is shown to form a basis apanning the same function space representable by fourier(trigonometric) series. A method for generating nonorthogonal bases for signal representation is presented tailor-made basis function can be used for specific purposes. Fundamental proofs of the basis properties of the representation are examined along with examples illustrating the techniques and computer simulation.

  • PDF

The effect of AP deployment on the accuracy of indoor localization (실내 측위에서 AP 배치가 측위 정확도에 미치는 영향 분석)

  • Kim, Sang-Dong;Lee, Jong-Hun;Jung, Woo-Young;Park, Yong-Wan
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.169-170
    • /
    • 2007
  • In this paper, we analyze the effect of access point (AP) deployment on the accuracy of indoor localization. Two representative geometrical arrangements of AP deployment are selected. One is that a Tag is centered at the regular triangle composed of 3 AP's, and the other is that a Tag is set apart from the straight line composed of 3 AP's. As a result of simulation, the first case has a probability of 93% with distance errors within 1m, while the second case has a 32% of probability.

  • PDF

Power Estimation of The Embedded 3D Graphics Renderer (내장형 3차원 그래픽 렌더링 처리기의 전력소모)

  • Jang, Tae-Hong;Lee, Moon-Key
    • Journal of Korea Game Society
    • /
    • v.4 no.3
    • /
    • pp.65-70
    • /
    • 2004
  • The conventional 3D graphic accelerator is mainly focused on high performance in the application area of computer graphic and 3D video game How ever the existing 3D architecture is not suitable for portable devices because of its huge power. So, we analyze the embedded 3D graphics renderer. After the analyzing, to reduce the power, triangle set-up stage and edge walking stage are executed sequentially while scan-line processing stage and span processing stage which control performance of 3D graphic accelerator are executed parallel.

  • PDF

An Effective Fuzzy Number Operation Method (Fuzzy수의 효율적인 산술연산수법)

  • Choi, Kyu-Hyoung
    • Proceedings of the KIEE Conference
    • /
    • 1993.07a
    • /
    • pp.489-491
    • /
    • 1993
  • Many optimization problem or multiple attribute, multiple alternative decision making problem may have fuzzy evaluation factors. In this case, fuzzy number operation technique is needed to evaluate and compare object functions which become fuzzy sets. Generally, fuzzy number operations can be defined by extension principle of fuzzy set theory, but it is tedious to do fuzzy number operations by using extension principle when the membership functions are defined by complex functions. Many fast methods which approximate the membership functions such as triangle, trapezoidal, or L-R type functions are proposed. In this paper, a fast fuzzy number operation method is proposed which do not simplify the membership functions of fuzzy numbers.

  • PDF

UNIFORM DISTRIBUTIONS ON CURVES AND QUANTIZATION

  • Joseph Rosenblatt;Mrinal Kanti Roychowdhury
    • Communications of the Korean Mathematical Society
    • /
    • v.38 no.2
    • /
    • pp.431-450
    • /
    • 2023
  • The basic goal of quantization for probability distribution is to reduce the number of values, which is typically uncountable, describing a probability distribution to some finite set and thus to make an approximation of a continuous probability distribution by a discrete distribution. It has broad application in signal processing and data compression. In this paper, first we define the uniform distributions on different curves such as a line segment, a circle, and the boundary of an equilateral triangle. Then, we give the exact formulas to determine the optimal sets of n-means and the nth quantization errors for different values of n with respect to the uniform distributions defined on the curves. In each case, we further calculate the quantization dimension and show that it is equal to the dimension of the object; and the quantization coefficient exists as a finite positive number. This supports the well-known result of Bucklew and Wise [2], which says that for a Borel probability measure P with non-vanishing absolutely continuous part the quantization coefficient exists as a finite positive number.

A Development of Bodice Pattern for Women Aged 18~24 Years

  • Park, Jae-Kyung;Lee, Jun-Ok;Jung, Jae-Eun
    • Journal of Fashion Business
    • /
    • v.15 no.3
    • /
    • pp.22-31
    • /
    • 2011
  • In this study, to develop a bodice pattern for women aged 18~24 years, statistical analysis was conducted using the body measurements from 2004 Size Korea and wearing test was conducted. As a result, ease of the bust level to set a horizontal line was decided to be 4cm, that of front interscye line 0cm, and that of back interscye line 0.7~1cm. And the line which divides the horizontal baseline into halves set as the side line. The conversion formula for decision of the scye depth line in the pattern is B/6 + 3.3(cm) + ease (2.5cm), and if bust circumference is 91 or more, it should be 21cm, and if bust circumference is 76 or less, it should be 18.5cm. The back neck line width is 7cm, front neck line width 6.5cm(back neck line width -0.5cm), and front neck depth 8cm(back neck line width +1cm). The shoulder slope was set as a slope of the hypotenuse of a right-angled triangle, which went out 15cm out of the shoulder point and went down 6cm, with tan$21.7^{\circ}$. To develop a final research pattern, wearing test was performed on the primary research pattern for 21 women aged 18~24 years. As a result, the research pattern was evaluated to be significantly higher.

A Fast Processing Algorithm for Lidar Data Compression Using Second Generation Wavelets

  • Pradhan B.;Sandeep K.;Mansor Shattri;Ramli Abdul Rahman;Mohamed Sharif Abdul Rashid B.
    • Korean Journal of Remote Sensing
    • /
    • v.22 no.1
    • /
    • pp.49-61
    • /
    • 2006
  • The lifting scheme has been found to be a flexible method for constructing scalar wavelets with desirable properties. In this paper, it is extended to the UDAR data compression. A newly developed data compression approach to approximate the UDAR surface with a series of non-overlapping triangles has been presented. Generally a Triangulated Irregular Networks (TIN) are the most common form of digital surface model that consists of elevation values with x, y coordinates that make up triangles. But over the years the TIN data representation has become an important research topic for many researchers due its large data size. Compression of TIN is needed for efficient management of large data and good surface visualization. This approach covers following steps: First, by using a Delaunay triangulation, an efficient algorithm is developed to generate TIN, which forms the terrain from an arbitrary set of data. A new interpolation wavelet filter for TIN has been applied in two steps, namely splitting and elevation. In the splitting step, a triangle has been divided into several sub-triangles and the elevation step has been used to 'modify' the point values (point coordinates for geometry) after the splitting. Then, this data set is compressed at the desired locations by using second generation wavelets. The quality of geographical surface representation after using proposed technique is compared with the original UDAR data. The results show that this method can be used for significant reduction of data set.

On Rate of Multi-Hole Injector for Diesel Engine (디이젤 기관용 다공연료 분사 밸브의 분사율 측정)

  • Jeong, Dal-Sun;An, Su-Gil;Gwon, Gi-Rin
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.22 no.1
    • /
    • pp.41-48
    • /
    • 1986
  • Ifis recommended that the injection rate should be accurate and reliable in the input data of the performance simulation in diesel engine. Matsuoka Sin improved W. Bosch's injection ratio measurement system. Matsuoka Sin reduced length of the test pipe and set the orifice. However, it was not measured accurately to measure the injection ratio due to reflection wave. In the present thesis, the improved measurement system with combination of the conventional W. Bosch type injection ratio measurement system and Matsuoka Sin type corrected W. Bosch type was practically made. The location of orifice and throttle valve was modified and set one more back pressure valve in order to reduce the effect of reflection wave. The results according to injection condition of multi-hole nozzle are following: 1. Measurement error of injection ratio measurement system in this thesis was $\pm$ 1 %, therefore, its reliability was good. 2. The form of injetion ratio is changed from trapezoidal shape to triangle shape with increase of revolution per minute when injection amount is constant. 3. In the case of constant rpm, the initial injection ratio is almost constant regardless of the amount, meanwhile the injection period becomes longer with increase of the amount. 4. The injection pressure of nozzle isn't largely influenced with injection ratio in the case of constant injection amount and rpm, otherwise the initial injection amount is increased by 3-4% when the injection pressure is low. 5. The injection ratio isn't nearly influenced with back pressure.

  • PDF

Development of Application to Deal with Large Data Using Hadoop for 3D Printer (하둡을 이용한 3D 프린터용 대용량 데이터 처리 응용 개발)

  • Lee, Kang Eun;Kim, Sungsuk
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.1
    • /
    • pp.11-16
    • /
    • 2020
  • 3D printing is one of the emerging technologies and getting a lot of attention. To do 3D printing, 3D model is first generated, and then converted to G-code which is 3D printer's operations. Facet, which is a small triangle, represents a small surface of 3D model. Depending on the height or precision of the 3D model, the number of facets becomes very large and so the conversion time from 3D model to G-code takes longer. Apach Hadoop is a software framework to support distributed processing for large data set and its application range gets widening. In this paper, Hadoop is used to do the conversion works time-efficient way. 2-phase distributed algorithm is developed first. In the algorithm, all facets are sorted according to its lowest Z-value, divided into N parts, and converted on several nodes independently. The algorithm is implemented in four steps; preprocessing - Map - Shuffling - Reduce of Hadoop. Finally, to show the performance evaluation, Hadoop systems are set up and converts testing 3D model while changing the height or precision.

A Contour Generation Algorithm for Visualizing Non-Lattice Type Data (비격자형 자료의 시각화를 위한 등치선도 생성 알고리즘)

  • Lee, Jun;Kim, Ji-In
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.2
    • /
    • pp.94-104
    • /
    • 2002
  • As a part of scientific data visualization automatic generation algorithms for a contour map have been investigated mainly on data which are defined at every lattice point. But in actual situation like weather data measurement. it is impossible to get data defined at every lattice point This is because the exact value on every lattice point can not be obtained due to characteristics in sampling devices or sampling methods. In order to define data on every lattice point where data were not sampled an interpolation method. was applied to the sample data to assign approximate values for some lattice type data but by using the non-lattice type of sample data sets. A triangle data link was defined by using non lattice points directly based on actually sample data set, not by using the pre-processed rectangle lattice points. The suggested algorithm generates a contour map a contour map only by using sample data set which are much smaller than old one without data interpolation and there is no skew on data any more since it does not need any interpolation to get the values of the defined lattice points.