• Title/Summary/Keyword: projection operator

Search Result 89, Processing Time 0.023 seconds

A PIVOT based Query Optimization Technique for Horizontal View Tables in Relational Databases (관계 데이터베이스에서 수평 뷰 테이블에 대한 PIVOT 기반의 질의 최적화 방법)

  • Shin, Sung-Hyun;Moon, Yang-Sae;Kim, Jin-Ho;Kang, Gong-Mi
    • The KIPS Transactions:PartD
    • /
    • v.14D no.2
    • /
    • pp.157-168
    • /
    • 2007
  • For effective analyses in various business applications, OLAP(On-Line Analytical Processing) systems represent the multidimensional data as the horizontal format of tables whose columns are corresponding to values of dimension attributes. Because the traditional RDBMSs have the limitation on the maximum number of attributes in table columns(MS SQLServer and Oracle permit each table to have up to 1,024 columns), horizontal tables cannot be directly stored into relational database systems. In this paper, we propose various efficient optimization strategies in transforming horizontal queries to equivalent vertical queries. To achieve this goral, we first store a horizontal table using an equivalent vertical table, and then develop various query transformation rules for horizontal table queries using the PIVOT operator. In particular, we propose various alternative query transformation rules for the basic relational operators, selection, projection, and join. Here, we note that the transformed queries can be executed in several ways, and their execution times will differ from each other. Thus, we propose various optimization strategies that transform the horizontal queries to the equivalent vertical queries when using the PIVOT operator. Finally, we evaluate these methods through extensive experiments and identify the optimal transformation strategy when using the PIVOT operator.

Facial Feature Detection and Facial Contour Extraction using Snakes (얼굴 요소의 영역 추출 및 Snakes를 이용한 윤곽선 추출)

  • Lee, Kyung-Hee;Byun, Hye-Ran
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.7
    • /
    • pp.731-741
    • /
    • 2000
  • This paper proposes a method to detect a facial region and extract facial features which is crucial for visual recognition of human faces. In this paper, we extract the MER(Minimum Enclosing Rectangle) of a face and facial components using projection analysis on both edge image and binary image. We use an active contour model(snakes) for extraction of the contours of eye, mouth, eyebrow, and face in order to reflect the individual differences of facial shapes and converge quickly. The determination of initial contour is very important for the performance of snakes. Particularly, we detect Minimum Enclosing Rectangle(MER) of facial components and then determine initial contours using general shape of facial components within the boundary of the obtained MER. We obtained experimental results to show that MER extraction of the eye, mouth, and face was performed successfully. But in the case of images with bright eyebrow, MER extraction of eyebrow was performed poorly. We obtained good contour extraction with the individual differences of facial shapes. Particularly, in the eye contour extraction, we combined edges by first order derivative operator and zero crossings by second order derivative operator in designing energy function of snakes, and we achieved good eye contours. For the face contour extraction, we used both edges and grey level intensity of pixels in designing of energy function. Good face contours were extracted as well.

  • PDF

A GENERAL ITERATIVE ALGORITHM FOR A FINITE FAMILY OF NONEXPANSIVE MAPPINGS IN A HILBERT SPACE

  • Thianwan, Sornsak
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.1_2
    • /
    • pp.13-30
    • /
    • 2010
  • Let C be a nonempty closed convex subset of a real Hilbert space H. Consider the following iterative algorithm given by $x_0\;{\in}\;C$ arbitrarily chosen, $x_{n+1}\;=\;{\alpha}_n{\gamma}f(W_nx_n)+{\beta}_nx_n+((1-{\beta}_n)I-{\alpha}_nA)W_nP_C(I-s_nB)x_n$, ${\forall}_n\;{\geq}\;0$, where $\gamma$ > 0, B : C $\rightarrow$ H is a $\beta$-inverse-strongly monotone mapping, f is a contraction of H into itself with a coefficient $\alpha$ (0 < $\alpha$ < 1), $P_C$ is a projection of H onto C, A is a strongly positive linear bounded operator on H and $W_n$ is the W-mapping generated by a finite family of nonexpansive mappings $T_1$, $T_2$, ${\ldots}$, $T_N$ and {$\lambda_{n,1}$}, {$\lambda_{n,2}$}, ${\ldots}$, {$\lambda_{n,N}$}. Nonexpansivity of each $T_i$ ensures the nonexpansivity of $W_n$. We prove that the sequence {$x_n$} generated by the above iterative algorithm converges strongly to a common fixed point $q\;{\in}\;F$ := $\bigcap^N_{i=1}F(T_i)\;\bigcap\;VI(C,\;B)$ which solves the variational inequality $\langle({\gamma}f\;-\;A)q,\;p\;-\;q{\rangle}\;{\leq}\;0$ for all $p\;{\in}\;F$. Using this result, we consider the problem of finding a common fixed point of a finite family of nonexpansive mappings and a strictly pseudocontractive mapping and the problem of finding a common element of the set of common fixed points of a finite family of nonexpansive mappings and the set of zeros of an inverse-strongly monotone mapping. The results obtained in this paper extend and improve the several recent results in this area.

Efficient Compression Algorithm with Limited Resource for Continuous Surveillance

  • Yin, Ling;Liu, Chuanren;Lu, Xinjiang;Chen, Jiafeng;Liu, Caixing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5476-5496
    • /
    • 2016
  • Energy efficiency of resource-constrained wireless sensor networks is critical in applications such as real-time monitoring/surveillance. To improve the energy efficiency and reduce the energy consumption, the time series data can be compressed before transmission. However, most of the compression algorithms for time series data were developed only for single variate scenarios, while in practice there are often multiple sensor nodes in one application and the collected data is actually multivariate time series. In this paper, we propose to compress the time series data by the Lasso (least absolute shrinkage and selection operator) approximation. We show that, our approach can be naturally extended for compressing the multivariate time series data. Our extension is novel since it constructs an optimal projection of the original multivariates where the best energy efficiency can be realized. The two algorithms are named by ULasso (Univariate Lasso) and MLasso (Multivariate Lasso), for which we also provide practical guidance for parameter selection. Finally, empirically evaluation is implemented with several publicly available real-world data sets from different application domains. We quantify the algorithm performance by measuring the approximation error, compression ratio, and computation complexity. The results show that ULasso and MLasso are superior to or at least equivalent to compression performance of LTC and PLAMlis. Particularly, MLasso can significantly reduce the smooth multivariate time series data, without breaking the major trends and important changes of the sensor network system.

Extracting the Slope and Compensating the Image Using Edges and Image Segmentation in Real World Image (실세계 영상에서 경계선과 영상 분할을 이용한 기울기 검출 및 보정)

  • Paek, Jaegyung;Seo, Yeong Geon
    • Journal of Digital Contents Society
    • /
    • v.17 no.5
    • /
    • pp.441-448
    • /
    • 2016
  • In this paper, we propose a method that segments the image, extracts its slope and compensate it in the image that text and background are mixed. The proposed method uses morphology based preprocessing and extracts the edges using canny operator. And after segmenting the image which the edges are extracted, it excludes the areas which the edges are included, only uses the area which the edges are included and creates the projection histograms according to their various direction slopes. Using them, it takes a slope having the greatest edge concentrativeness of each area and compensates the slope of the scene. On extracting the slope of the mixed scene of the text and background, the method can get better results as 0.7% than the existing methods as it excludes the useless areas that the edges do not exist.

Head Gesture Recognition using Facial Pose States and Automata Technique (얼굴의 포즈 상태와 오토마타 기법을 이용한 헤드 제스처 인식)

  • Oh, Seung-Taek;Jun, Byung-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.12
    • /
    • pp.947-954
    • /
    • 2001
  • In this paper, we propose a method for the recognition of various head gestures with automata technique applied to the sequence of facial pose states. Facial regions as detected by using the optimum facial color of I-component in YIQ model and the difference of images adaptively selected. And eye regions are extracted by using Sobel operator, projection, and the geometric location of eyes Hierarchical feature analysis is used to classify facial states, and automata technique is applied to the sequence of facial pose states to recognize 13 gestures: Gaze Upward, Downward, Left ward, Rightward, Forward, Backward Left Wink Right Wink Left Double Wink, Left Double Wink , Right Double Wink Yes, and No As an experimental result with total 1,488 frames acquired from 8 persons, it shows 99.3% extraction rate for facial regions, 95.3% extraction rate for eye regions 94.1% recognition rate for facial states and finally 99.3% recognition rate for head gestures. .

  • PDF

Magneto-optical Properties of 55Mn-doped SrTiO3 Single Crystal (55Mn이 첨가된 SrTiO3 단 결정의 광 전이 특성연구)

  • Bae, Kyu-Chan;Park, Jung-Il;Lee, Hyeong-Rag
    • Journal of the Korean Magnetics Society
    • /
    • v.21 no.6
    • /
    • pp.208-213
    • /
    • 2011
  • We calculated the EPR (electron paramagnetic resonance) line-shape function. The line-widths of a -doped single crystal was studied as a function of the temperature with 0.5 and 2 at. at a frequency of (X-band). The line-width decreases with increasing temperature, such temperature behavior of the line-width can indicate a motional narrowing of the spectrum, when impurity ions substitute for host ions in an off-center position, and thus there can be fast jumping of dipoles between several symmetrically equivalent configurations. Therefore, the present technique is considered to be more convenient to explain the resonant system as in the case of other optical transition problems.

Radiation Dose Reduction of Lens by Adjusting Table Height and Magnification Ratio in 3D Cerebral Angiography (삼차원 뇌혈관조영술에서 테이블 높이와 확대율 조절에 따른 수정체 선량 감소에 대한 연구)

  • Yoon, Jong-Tae;Lee, Ki-Baek
    • Journal of radiological science and technology
    • /
    • v.45 no.4
    • /
    • pp.313-320
    • /
    • 2022
  • Both angiography and interventional procedures accompanied by angiography provide many diagnostic and therapeutic benefits to patients and are rapidly increasing. However, unlike general radiography or computed tomography using the same X-ray, the amount of radiation is quite high, but the dose range can vary considerably for each patient and operator. The high sensitivity of the lens to radiation during cerebral angiography and neurointervention is already well known, and although there are many related studies, it is insufficient to easily reduce radiation in diagnosis and treatment. In this situation, in particular, by adding three-dimensional rotational angiography (3D-RA) to the existing two-dimensional (2D) angiography, it is now possible to make an accurate diagnosis. However, since this 3D-RA acquires images through projection of more radiation than before, the exposure dose of the lens may be higher. Therefore, we tried to analyze whether the radiation dose of the lens can be reduced by moving the lens out of the field range by adjusting the table height and magnification ratio during the examination using 3D-RA. The surface dose was measured using a rando phantom and a radiophotoluminescent glass dosimeter (PLD) and the radiation dose was compared by adjusting the table height and magnification ratio based on the central point. As a result, it was found that the radiation dose of the lens decreased as the table height increased from the central point, that is, as the lens was out of the field of view. In conclusion, in 3D-RA, moving the table position of about 2 cm in height will make a significant contribution to the dose reduction of the lens, and it was confirmed that adjusting the magnification ratio can also reduce the surface dose of the lens.

LiDAR Chip for Automated Geo-referencing of High-Resolution Satellite Imagery (라이다 칩을 이용한 고해상도 위성영상의 자동좌표등록)

  • Lee, Chang No;Oh, Jae Hong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.32 no.4_1
    • /
    • pp.319-326
    • /
    • 2014
  • The accurate geo-referencing processes that apply ground control points is prerequisite for effective end use of HRSI (High-resolution satellite imagery). Since the conventional control point acquisition by human operator takes long time, demands for the automated matching to existing reference data has been increasing its popularity. Among many options of reference data, the airborne LiDAR (Light Detection And Ranging) data shows high potential due to its high spatial resolution and vertical accuracy. Additionally, it is in the form of 3-dimensional point cloud free from the relief displacement. Recently, a new matching method between LiDAR data and HRSI was proposed that is based on the image projection of whole LiDAR data into HRSI domain, however, importing and processing the large amount of LiDAR data considered as time-consuming. Therefore, we wmotivated to ere propose a local LiDAR chip generation for the HRSI geo-referencing. In the procedure, a LiDAR point cloud was rasterized into an ortho image with the digital elevation model. After then, we selected local areas, which of containing meaningful amount of edge information to create LiDAR chips of small data size. We tested the LiDAR chips for fully-automated geo-referencing with Kompsat-2 and Kompsat-3 data. Finally, the experimental results showed one-pixel level of mean accuracy.