• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제11권4호
• /
• pp.280-286
• /
• 1986

A newmethod of fast mask operators for edge detection is proposed, which is based on the matrix factorization. The output of each component in the multi-directional mask operator is obtained adding every image pixels in the mask area weighting by corresponding mask element. Therefore, it is same as the result of matrix-vector multiplication like one dimensional transform, i, e, , trasnform of an image vector surrounded by mask with a transform matrix consisted of all the elements of eack mask row by row. In this paper, for the Sobel and Prewitt operators, we find the transform matrices, add up the number of operations factoring these matrices and compare the performances of the proposed method and the standard method. As a result, the number of operations with the proposed method, for Sobel and prewitt operators, without any extra storage element, are reduced by 42.85% and 50% of the standard operations, respectively and in case of an image having 100x100 pixels, the proposed Sobel operator with 301 extra storage locations can be computed by 35.93% of the standard method.

• Journal of Korean Society for Atmospheric Environment
• /
• 제24권1호
• /
• pp.30-42
• /
• 2008

In this study, the chemical compositions of $PM_{2.5}$ samples collected at the Redwood National Park IMPROVE site in California from March 1988 to May 2004 were analyzed to provide source identification and apportionment. A total of 1,640 samples were collected and 33 chemical species were analyzed by particle induced X-ray emission, proton elastic scattering analysis, photon induced X-ray fluorescence, ion chromatography, and thermal optical reflectance methods. Positive matrix factorization (PMF) was used to develop source profiles and to estimate their mass contributions. The PMF modeling identified five sources and the average mass was apportioned to motor vehicle (35.8%, $1.58\;{\mu}g/m^3$), aged sea salt (23.2%, $1.02\;{\mu}g/m^3$), fresh sea salt (21.4%, $0.94\;{\mu}g/m^3$), wood/field burning (16.1%, $0.71\;{\mu}g/m^3$), and airborne soil (3.5%, $0.15\;{\mu}g/m^3$), respectively. To analyze local source impacts from various wind directions, the CPF and NPR analyses were performed using source contribution results with the wind direction values measured at the site. These results suggested that sources of $PM_{2.5}$ are also sources of visibility degradation and then source apportionment studies derived for $PM_{2.5}$ are also used for understanding visibility problem.

• The KIPS Transactions:PartB
• /
• 제9B권5호
• /
• pp.563-570
• /
• 2002

Robust extraction of 3D facial features and global motion information from 2D image sequence for the MPEG-4 SNHC face model encoding is described. The facial regions are detected from image sequence using multi-modal fusion technique that combines range, color and motion information. 23 facial features among the MPEG-4 FDP (Face Definition Parameters) are extracted automatically inside the facial region using color transform (GSCD, BWCD) and morphological processing. The extracted facial features are used to recover the 3D shape and global motion of the object using paraperspective camera model and SVD (Singular Value Decomposition) factorization method. A 3D synthetic object is designed and tested to show the performance of proposed algorithm. The recovered 3D motion information is transformed into global motion parameters of FAP (Face Animation Parameters) of the MPEG-4 to synchronize a generic face model with a real face.

• The Journal of Information Technology
• /
• 제6권1호
• /
• pp.1-10
• /
• 2003

In this paper, a public key exponential encryption algorithm for data security of computer network is proposed. This is based on the security to a difficulty of polynomial factorization. For the proposed public key exponential encryption, the public key generation algorithm selects two polynomials f(x,y,z) and g(x,y,z). The enciphering first selects plaintext polynomial W(x,y,z) and multiplies the public key polynomials, then the ciphertext is computed. In the proposed exponential encryption system of public key polynomial, an encryption is built by exponential encryption multiplied thrice by the optional integer number and again plus two public polynomials f(x,y,z) and g(x,y,z). This is an encryption system to enforce the security of encryption with help of prime factor added on RSA public key. The propriety of the proposed public key exponential cryptosystem algorithm is verified with the computer simulation.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• 제26권1호
• /
• pp.85-91
• /
• 2008

When a large sparse matrix is calculated for a horizontal geodetic network adjustment, it needs to go through the process of matrix reordering for the efficiency of time and space. In this study, several reordering methods for sparse matrix were tested, using Sparse Matrix Manipulation System(SMMS) program, total processing time and Fill-in number produced in factorization process were measured and compared. As a result, Minimum Degree(MD) and Mutiple Minimum Degree(MMD), which are based on Minimum Degree are better than Gibbs-Poole-Stockmeyer(GPS) and Reverse Cuthill-Mckee(RCM), which are based on Minimum Bandwidth. However, the method of the best efficiency can be changed dependent on distribution of non-zero elements in a matrix. This finding could be applied to heighten the efficiency of time and storage space for national datum readjustment and other large geodetic network adjustment.

• The KIPS Transactions:PartB
• /
• 제17B권3호
• /
• pp.183-188
• /
• 2010

A factorization-based 3D reconstruction system is realized to recover 3D scene from an image sequence. The image sequence is captured from uncalibrated perspective camera from several views. Many matched feature points over all images are obtained by feature tracking method. Then, these data are supplied to the 3D reconstruction module to obtain the projective reconstruction. Projective reconstruction is converted to Euclidean reconstruction by enforcing several metric constraints. After many triangular meshes are obtained, realistic reconstruction of 3D models are finished by texture mapping. The developed system is implemented in C++, and Qt library is used to implement the system user interface. OpenGL graphics library is used to realize the texture mapping routine and the model visualization program. Experimental results using synthetic and real image data are included to demonstrate the effectiveness of the developed system.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• 제18권5호
• /
• pp.112-125
• /
• 2019

An acoustic signal-based, tunnel-incident detection system was developed and evaluated. The system was comprised of three components: algorithm, acoustic signal collector, and server system. The algorithm, which was based on nonnegative tensor factorization and a hidden Markov model, processes the acoustic signals to attenuate noise and detect incident-related signals. The acoustic signal collector gathers the tunnel sounds, digitalizes them, and transmits the digitalized acoustic signals to the center server. The server system issues an alert once the algorithm identifies an incident. The performance of the system was evaluated thoroughly in two steps: first, in a controlled tunnel environment using the recorded incident sounds, and second, in an uncontrolled tunnel environment using real-world incident sounds. As a result, the detection rates ranged from 80 to 95% at distances from 50 to 10 m in the controlled environment, and 94 % in the uncontrolled environment. The superiority of the developed system to the existing video image and loop detector-based systems lies in its instantaneous detection capability with less than 2 s.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제21권1호
• /
• pp.87-92
• /
• 2021

Bias, variance, error and learning are important factors for performance in modeling a big data based recommendation system. The recommendation model in this system must reduce complexity while maintaining the explanatory diagram. In addition, the sparsity of the dataset and the prediction of the system are more likely to be inversely proportional to each other. Therefore, a product recommendation model has been proposed through learning the similarity between products by using a factorization method of the sparsity of the dataset. In this paper, the generalization ability of the model is improved by applying the max-norm regularization as an optimization method for the loss function of this model. The solution is to apply a stochastic projection gradient descent method that projects a gradient. The sparser data became, it was confirmed that the propsed regularization method was relatively effective compared to the existing method through lots of experiment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제13권1호
• /
• pp.11-18
• /
• 2003

As the Internet moves to mobile environment, one of the most serious problems for the security is to required a new security Protocol with safety and efficiency. To solve the problem. we Propose a new Protocol that reduces the communication franc and solves the problem associated with the private security keys supplied by the trusted third party. The protocol is a non-Interactive oblivious transfer protocol, based on the EIGamal public-key algorithm. Due to its Non-Interactive oblivious transfer protocol, it can effectively reduce communication traffic in server-client environment. And it is also possible to increase the efficiency of protocol through the mechanism that authentication probability becomes lower utilizing a challenge selection bit. The protocol complexity becomes higher because it utilizes double exponentiation. This means that the protocol is difficult rather than the existing discrete logarithm or factorization in prime factors. Therefore this can raise the stability of protocol.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제31권3호
• /
• pp.517-526
• /
• 2021

Recently, the acceleration of the development of quantum computers has raised the issue of the safety of factorization and discrete logarithm based digital signature schemes used in existing Internet environments. To solve the issue, several digital signature schemes are presented that are safe in post-quantum computing environments, including standardization work by the National Institute of Standards and Technology(NIST). In this paper, we design and present a multi-signature scheme based on the TACHYON announced by Behnia et al. in 2018 CCS conference, and prove the security. Multi-signature schemes are key techniques that can distribute the dependence of cryptocurrency-wallet on private keys in the cryptocurrency field, which has recently received much attention as an digital signature application, and many researchers and developers have recently been interested. The multi-signature scheme presented in this paper enables public key aggregation in a plain public key model, which does not require additional zero-knowledge proof, and can construct an effective scheme with only an aggregated public key.