Search For:

Displaying 1-48 out of 48 total
An O(1) Time Parallel Algorithm for the Dominance Counting and 3D Block-Based Medial Axis Transform on AROB
Found in: Parallel and Distributed Computing Applications and Technologies, International Conference on
By Shih-Ying Lin, Shi-Jinn Horng, Tzong-Wann Kao, Yuh-Rau Wang
Issue Date:December 2005
pp. 603-609
In this paper, we present a constant time algorithm for solving three dimensional block-based medial axis transform (3D BB-MAT, for short) on the array with reconfigurable optical buses (AROB). The main contribution of this work is to exploit the dominance...
 
The chessboard distance transform and the medial axis transform are interchangeable
Found in: Parallel Processing Symposium, International
By Yu-Hua Lee, Shi-Jinn Horng
Issue Date:April 1996
pp. 424
The distance transform (DT) and the medial axis transform (MAT) are two image computation tools used to extract information about the shape and position of foreground pixels relative to each other. Extensively applications of these two transforms are used ...
 
An Optimal Parallel Algorithm for Computing Moments on Arrays with Reconfigurable Optical Buses
Found in: Parallel and Distributed Processing Symposium, International
By Chin-Hsiung Wu, Shi-Jinn Horng, Jinn-Fu Lin, Horng-Ren Tsai, Tsrong-Lay Lin
Issue Date:May 2000
pp. 741
Computing the moments of a two-dimensional (2-D) image involves a significant amount of multiplications and additions in a direct method. In this paper, we use the suffix sums to compute the 2-D moments instead of using a direct method. This method can red...
 
Optimal Algorithms for the Channel-Assignment Problem on a Reconfigurable Array of Processors with Wider Bus Networks
Found in: IEEE Transactions on Parallel and Distributed Systems
By Shi-Jinn Horng, Horng-Ren Tsai, Yi Pan, Jennifer Seitzer
Issue Date:November 2002
pp. 1124-1138
<p><b>Abstract</b>—The computation model on which the algorithms are developed is the reconfigurable array of processors with wider bus networks (abbreviated to RAPWBN). The main difference between the RAPWBN model and other existing reco...
 
Solving An Algebraic Path Problem and Some Related Graph Problems on a Hyper-Bus Broadcast Network
Found in: IEEE Transactions on Parallel and Distributed Systems
By Horng-Ren Tsai, Shi-Jinn Horng, Shun-Shan Tsai, Tzong-Wann Kao, Shung-Shing Lee
Issue Date:December 1997
pp. 1226-1235
<p><b>Abstract</b>—The parallel computation model upon which the proposed algorithms are based is the hyper-bus broadcast network. The hyper-bus broadcast network consists of processors which are connected by global buses only. Based on s...
 
Some image processing algorithms on a RAP with wider bus networks
Found in: Parallel Processing Symposium, International
By Shung-Shing Lee, Shi-Jinn Horng, Horng-Ren Tsai, Yu-Hua Lee
Issue Date:April 1996
pp. 708
Based on the reconfigurable array of processors with wider bus networks (Li et al., 1995), we propose a series of algorithms for image processing. Conventionally, only one bus is connected between two processors but in this machine it has a set of buses. S...
 
Designing Efficient Parallel Algorithms on CRAP
Found in: IEEE Transactions on Parallel and Distributed Systems
By Tzong-Wann Kao, Shi-Jinn Horng, Yue-Li Wang, Horng-Ren Tsai
Issue Date:May 1995
pp. 554-560
<p><it>Abstract—</it>A cross-bridge reconfigurable array of processors is a parallel processing system which has the ability to change dynamically the supported interconnection scheme during the execution of an algorithm. Based on this ar...
 
Computing Connected Components and Some Related Applications on a Rap
Found in: Parallel Processing, International Conference on
By Tzong-Wann Kao, Shi-Jinn Horng, Horng-Ren Tsai
Issue Date:August 1993
pp. 57-64
A reconfigurable array of processors (RAP) is a parallel processing system which has the ability to change dynamically the supported interconnection scheme during the execution of an algorithm.
 
A Rough Set-Based Method for Updating Decision Rules on Attribute Values’ Coarsening and Refining
Found in: IEEE Transactions on Knowledge and Data Engineering
By Hongmei Chen,Tianrui Li,Chuan Luo,Shi-Jinn Horng,Guoyin Wang
Issue Date:December 2014
pp. 1-1
Rule induction method based on rough set theory (RST) has received much attention recently since it may generate a minimal set of rules from the decision system for real-life applications by using of attribute reduction and approximations. The decision sys...
 
Copyright Protection for E-Government Document Images
Found in: IEEE MultiMedia
By Didi Rosiyadi,Shi-Jinn Horng,Pingzhi Fan,Xian Wang,Muhammad Khurram Khan,Yi Pan
Issue Date:July 2012
pp. 62-73
The proposed copyright protection scheme combines the discrete cosine transform (DCT) and singular value decomposition (SVD) using a control parameter to avoid the false-positive problem.
 
Anti-forensic Steganography Using Multi-bit Minimum Error Replacement with Flexible Bit Location
Found in: Computer, Consumer and Control, International Symposium on
By Rong-Jian Chen,Jui-Lin Lai,Shi-Jinn Horng
Issue Date:June 2012
pp. 175-178
Multi-bit minimum error replacement (MER) is a method that can embed multi-bit logo/secret data into k least-significant bits (LSBs) of cover data only introduces minimum embedding error (MEE). However, k-LSBs MER suffers from weak anti-forensics. Moreover...
 
Multi-bit Adaptive Embedding Algorithm for Anti-forensic Steganography
Found in: Biometrics and Security Technologies, International Symposium on
By Rong-Jian Chen,Shi-Jinn Horng
Issue Date:March 2012
pp. 82-89
Multi-bit minimum error replacement (MER) is a method that can embed multi-bit logo/secret data into k least-significant bits (LSBs) of cover data only introduces minimum embedding error (MEE). However, k-LSBs MER suffers from weak anti-forensics. Moreover...
 
Hardware Resource Manager for Reconfiguration System
Found in: Biometrics and Security Technologies, International Symposium on
By Chih-Tung Lin,Shi-Jinn Horng,Yao-Lin Huang
Issue Date:March 2012
pp. 59-65
This paper is mainly to propose a hardware resource manager for the reconfiguration system. In order to make the system replace the module accurately, the hardware resource manager must thoroughly possess resource indices to present current status of hardw...
 
A Hybrid Forecasting Model Based on Adaptive Fuzzy Time Series and Particle Swarm Optimization
Found in: Biometrics and Security Technologies, International Symposium on
By Yao-Lin Huang,Shi-Jinn Horng,Tzong-Wang Kao,I-Hong Kuo,Terano Takao
Issue Date:March 2012
pp. 66-70
Limited historical data and large fluctuations are two important issues for forecasting time series. In this paper, a hybrid forecasting model based on adaptive fuzzy time series and particle swarm optimization is proposed to address these issues. In the t...
 
An Efficient Run Time Control Flow Errors Detection by DCT Technique
Found in: Biometrics and Security Technologies, International Symposium on
By Hung-Chuan Lai,Shi-Jinn Horng,Pingzhi Fan,Xian Wang,Yi Pan
Issue Date:March 2012
pp. 134-150
DCT is usually used in image processing but in this paper we use it to detect the run time control errors. In this paper, using the branch instruction, a program is first divided into several data computing blocks (DCBs), each DCB can then be recognized as...
 
Call dropping performance analysis of the eNB-first channel access policy in LTE-Advanced relay networks
Found in: Wireless and Mobile Computing, Networking and Communication, IEEE International Conference on
By Xian Wang, Shi-Jinn Horng, Ray-Guang Cheng, Pingzhi Fan
Issue Date:October 2011
pp. 43-50
Relay is one of the key technologies used by both the Third Generation Partnership Project (3GPP) Long Term Evolution-Advanced (LTE-Advanced) and IEEE 802.16m to ameliorate cell edge throughput. Despite the throughput enhancement achieved by deploying rela...
 
Novel Multi-bit Watermarking Using Adaptive Embedding Algorithms with Minimum Error
Found in: Complex, Intelligent and Software Intensive Systems, International Conference
By Rong-Jian Chen, Jui-Lin Lai, Shi-Jinn Horng
Issue Date:July 2011
pp. 211-218
This paper presents the novel multi-bit watermarking using adaptive embedding algorithms with minimum error. These embedding algorithms can embed multi-bit (k-bit, k>=1 ) logo data into cover data only introduce minimum embedding errors which are restri...
 
Novel Multi-bit and Multi-image Steganography Using Adaptive Embedding Algorithms with Minimum Error
Found in: Innovative Mobile and Internet Services in Ubiquitous Computing, International Conference on
By Rong-Jian Chen, Jui-Lin Lai, Shi-Jinn Horng
Issue Date:July 2011
pp. 221-228
This paper presents a novel multi-bit and multi-image steganography system using adaptive embedding algorithms with minimum error. These embedding algorithms can embed multi-bit (k-bit, k>=1) secret data into cover data only introduce minimum embedding ...
 
Novel Multi-bit Bitwise Adaptive Embedding Algorithms with Minimum Error for Data Hiding
Found in: Network and System Security, International Conference on
By Rong-Jian Chen, Yu-Cheng Peng, Jun-Jian Lin, Jui-Lin Lai, Shi-Jinn Horng
Issue Date:September 2010
pp. 306-311
This paper presents the novel multi-bit bitwise adaptive embedding algorithms for data hiding. These embedding algorithms can embed multi-bit (k-bit, k>=1 ) secret data into cover data only introduce minimum embedding error smaller than (2^(k-1)-1)*2^(i...
 
A Novel Blind Reversible Method for Watermarking Relational Databases
Found in: Parallel and Distributed Processing with Applications, International Symposium on
By Mahmoud E. Farfoura, Shi-Jinn Horng
Issue Date:September 2010
pp. 563-569
Digital Watermarking technology was introduced in the past few years, not only to ensure the ownership of the digital media, but also to ensure the integrity of those digital media. Reversible watermark (which is also called invertible watermark, or erasab...
 
An Improved Score Level Fusion in Multimodal Biometric Systems
Found in: Parallel and Distributed Computing Applications and Technologies, International Conference on
By Shi-Jinn Horng, Yuan-Hsin Chen, Ray-Shine Run, Rong-Jian Chen, Jui-Lin Lai, Kevin Octavius Sentosal
Issue Date:December 2009
pp. 239-246
In a multimodal biometric system, the effective fusion method is necessary for combining information from various single modality systems. In this paper we examined the performance of sum rule-based score level fusion and Support Vector Machines (SVM)-base...
 
Architecture Design of High Efficient and Non-memory AES Crypto Core for WPAN
Found in: Network and System Security, International Conference on
By Rong-Jian Chen, Yu-Cheng Peng, Jui-Lin Lai, Shi-Jinn Horng
Issue Date:October 2009
pp. 36-43
This paper presents the architecture design of a high efficient and non-memory Advanced Encryption Standard (AES) crypto core to fit WPAN security requirement. The proposed basis transformation approach from Galois Field (28) to Galois Field GF(((22)2)2) c...
 
Implementation of Different Function Units Using Flexible and Reconfigurable Architecture
Found in: Information Technology: New Generations, Third International Conference on
By Chao-Jang Hwang, Chih-Tung Lin, Shi-Jinn Horng
Issue Date:April 2009
pp. 84-89
With the multidigital era approaching, multimedia has shown up and become more and more demand in present lives; based on this reason, the status of hardware resource is insufficient as well as the function of a chip is out of request such as PDA, mobile p...
 
An Online Control Flow Check for VLIW Processor
Found in: Pacific Rim International Symposium on Dependable Computing, IEEE
By Hung-Chuan Lai, Shi-Jinn Horng, Yung-Yuan Chen
Issue Date:December 2008
pp. 256-264
In this paper, we base on data computing blocks (DCBs) and DCT watchdog technology to implement VLIW watchdog processor. 32-bit final DCT signature (F-DCT-S) and several 5-bit relay DCT signatures (R-DCT-S) will be computed by DCT watchdog scheme. These ge...
 
A Blind Watermarking Scheme Based on Wavelet Tree Quantization
Found in: Secure System Integration and Reliability Improvement
By Wei-Hung Lin, Yuh-Rau Wang, Shi-Jinn Horng
Issue Date:July 2008
pp. 89-95
This paper proposes a blind watermarking scheme based on wavelet tree quantization for copyright protection. In such a quantization scheme, there exists a large significant difference while embedding a watermark bit 1 and a watermark bit 0; it then does no...
 
A New Concurrent Detection of Control Flow Errors Based on DCT Technique
Found in: Pacific Rim International Symposium on Dependable Computing, IEEE
By Hung-Chuan Lai, Shi-Jinn Horng, Yong-Yuan Chen, Pingzhi Fan, Yi Pan
Issue Date:December 2007
pp. 201-209
In this paper, a program is first divided into several data computing blocks (DCBs) by the branch instruction; each DCB can then be recognized as an image. We then use the one dimension discrete cosine transform (1-D DCT) to compute each DCB to generate se...
 
An Enhanced Anti-collision Algorithm in RFID Based on Counter and Stack
Found in: Systems and Networks Communication, International Conference on
By Wei-Chih Chen, Shi-Jinn Horng, Pingzhi Fan
Issue Date:August 2007
pp. 21
Radio Frequency Identification has been developed for many years and it got much attention from researchers recently as there are lots of applications being used practically in the real world. Owing to the shared wireless channel between tags and reader du...
 
Dependabilities in a High-performance Quantum Real-time Distributed System
Found in: Information Technology: New Generations, Third International Conference on
By Yao-Hsin Chou, I-Ming Tsai, Chin-Shyurng Fahn, Shi-Jinn Horng, Sy-Yen Kuo
Issue Date:April 2007
pp. 1107-1112
Two processors jointly provide a real-time service which can be completed by exactly one processor. Assuming each processor is allowed to announce only a one-bit information in a distributed way to decide which one should process the job, inevitably some o...
 
Quantum Entanglement, Non-Locality and Secure Computation
Found in: Quantum, Nano, and Micro Technologies, First International Conference on
By Yao-Hsin Chou, I-Ming Tsai, Chin-Shyurng Fahn, Shi-Jinn Horng, Sy-Yen Kuo
Issue Date:January 2007
pp. 15
In this paper, we demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. We study the possibility of performing secure computation by building non-local machines based ...
 
An E-Mail Client Implementation with Spam Filtering and Security Mechanisms
Found in: Web Services, IEEE International Conference on
By Shi-Jinn Horng, Ming-Yang Su, Chao-Yi Wu
Issue Date:July 2005
pp. 783-784
Two main goals of our e-mail client system are filtering out junk e-mails and blocking e-mail sent out by malicious code. The famous Ling-Spam Corpus was experimented to show the good performance of our system. Moreover, our system can prevent malicious co...
   
Embedded Fingerprint Verification System
Found in: Parallel and Distributed Systems, International Conference on
By Gwo-Cheng Chao, Shung-Shing Lee, Hung-Chuan Lai, Shi-Jinn Horng
Issue Date:July 2005
pp. 52-57
<p>Fingerprint verification is one of the most reliable personal identification methods in biometrics. In this paper, an effective fingerprint verification system is presented. We describe an enhanced fingerprint verification system consisting of ima...
 
Fast All Nearest Neighbor Algorithms from Image Processing Perspective
Found in: Parallel and Distributed Processing Symposium, International
By Yuh-Rau Wang, Shi-Jinn Horng, Hung-Chang Chan
Issue Date:April 2005
pp. 9a
In this paper, we solve the k-dimensional all nearest neighbor (kD_ANN) problem, where k = 2 or 3, on a linear array with a reconfigurable pipelined bus system (LARPBS) from image processing perspective. Three scalable O(1) time algorithms are proposed, on...
 
Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System
Found in: IEEE Transactions on Parallel and Distributed Systems
By Yuh-Rau Wang, Shi-Jinn Horng, Chin-Hsiung Wu
Issue Date:March 2005
pp. 193-206
<p><b>Abstract</b>—In this paper, we present two <tmath>O(1)</tmath> time algorithms for solving the 2D all nearest neighbor (2D_ANN) problem, the 2D closest pair (2D_CP) problem, the 3D all nearest neighbor (3D_ANN) problem a...
 
An Integrated Fault-Tolerant Design Framework for VLIW Processors
Found in: Defect and Fault-Tolerance in VLSI Systems, IEEE International Symposium on
By Yung-Yuan Chen, Shi-Jinn Horng, Hung-Chuan Lai
Issue Date:November 2003
pp. 555
In this study, a fault-tolerant design framework of VLIW processor is proposed. Specifically, this paper concentrates on the issue of dependable data path design. We first use three identical functional modules in the data paths to demonstrate our fault-to...
 
An O(1)Time Algorithm for the 3D Euclidean Distance Transform on the CRCW PRAM Model
Found in: IEEE Transactions on Parallel and Distributed Systems
By Yuh-Rau Wang, Shi-Jinn Horng
Issue Date:October 2003
pp. 973-982
<p><b>Abstract</b>—In this paper, we develop a parallel algorithm for the 2D Euclidean distance transform (2D_EDT, for short) of a binary image of size N x N in O(1)time using <tmath>N^{2+\delta+\epsilon}</tmath> CRCW processo...
 
Parallel Computation of the Euclidean Distance Transform on a Three-Dimensional Image Array
Found in: IEEE Transactions on Parallel and Distributed Systems
By Yu-Hua Lee, Shi-Jinn Horng, Jennifer Seitzer
Issue Date:March 2003
pp. 203-212
<p><b>Abstract</b>—In a two- or three-dimensional image array, the computation of <it>Euclidean distance transform</it> (EDT) is an important task. With the increasing application of 3D voxel images, it is useful to consider t...
 
Parallel Algorithms for Median Filtering on Arrays with Reconfigurable Optical Buses
Found in: Parallel and Distributed Processing Symposium, International
By Chin-Hsiung Wu, Shi-Jinn Horng, Yi Pan
Issue Date:April 2002
pp. 0150
The main contributions of this paper are in designing fast and scalable parallel algorithms for selection and median filtering. Based on the radix-\omega representation and the power of pipelined optical buses, we first design a constant time selection alg...
 
Fast Computation of the 3-D Euclidean Distance Transform on the EREW PRAM Model
Found in: Parallel Processing, International Conference on
By Yu-Hua Lee, Shi-Jinn Horng, Jennifer Seitzer
Issue Date:September 2001
pp. 0471
Abstract: In a two or three-dimensional image array, the computation of Euclidean distance transform (EDT) is an important task. With the increasing application of 3D voxel images, it is useful to consider the distance transform of a 3D digital image array...
 
An Efficient and Authenticated Group-Oriented Cryptoscheme Based on a Geometric Method in Internet Environments
Found in: Parallel and Distributed Systems, International Conference on
By Woei-Jiunn Tsaur, Shi-Jinn Horng, Shung-Shing Lee, Ruey-Chang Tsai
Issue Date:December 1997
pp. 640
Based on a geometric method, this paper presents an efficient and authenticated cryptoscheme for establishing secure group-oriented data communications in internet environments. We assume that the internet environments consist of many hosts, and each host ...
 
Embedding of Generalized Fibonacci Cubes in Hypercubes with Faulty Nodes
Found in: IEEE Transactions on Parallel and Distributed Systems
By Feng-Shr Jiang, Shi-Jinn Horng, Tzong-Wann Kao
Issue Date:July 1997
pp. 727-737
<p><b>Abstract</b>—The <it>generalized Fibonacci cubes</it> (abbreviated to GFCs) [<ref rid=
 
Fast parallel chessboard distance transform algorithms
Found in: Parallel and Distributed Systems, International Conference on
By Yu-Hua Lee, Shi-Jinn Horng
Issue Date:June 1996
pp. 488
In this paper, based on the diagonal propagation approach, we first provide an O(N2) time sequential algorithm to compute the chessboard distance transform (CDT) of an N X N image, which is a DT using the chessboard distance metrics. Based on the proposed ...
 
Toward Software Metrics for Distributed Software
Found in: Asia-Pacific Software Engineering Conference
By Woei-Jiunn Tsaur, Shi-Jinn Horng
Issue Date:December 1995
pp. 209
With increasing complication in distributed software we must do our best to establish the mechanism of maintaining distributed software. This paper presents generalized software complexity metrics for measuring the computation complexity of distributed pro...
 
Computing k-Vertex Connectivity on an Interval Graph
Found in: Parallel Processing, International Conference on
By Tzong-Wann Kao, Shi-Jinn Horng
Issue Date:August 1994
pp. 218-221
We show that determine the maximum number of vertex connectivity, test k-vertex connectivity and determine the maximum number of vertex disjoint I_s - l_t paths of interval graphs can be solved either in O(log n) time using O{n) processors for the Unsorted...
 
Enhancement of Generalized Ring Signatures with Convertibility
Found in: Biometrics and Security Technologies, International Symposium on
By Shiang-Feng Tzeng,Shi-Jinn Horng
Issue Date:March 2012
pp. 71-76
Ring signature is a kind of group-oriented signature. It allows a member of a group to sign messages on behalf of the group without revealing her/his identity. The verifier can be convinced that the signature was indeed generated by one of the ring members...
 
Run-Length Chain Coding and Shape's Moment Computations on Arrays with Reconfigurable Optical Buses
Found in: Parallel Processing, International Conference on
By Chin-Hsiung Wuy, Shi-Jinn Horng, Yi-Wen Chenz, Chen-Kuo Yux
Issue Date:September 2001
pp. 0479
Abstract: The main contribution of this paper is the design of several efficient algorithms for modified run-length chain coding and for computing shape's moments on arrays with reconfigurable optical buses. We first propose two constant time algorithms fo...
 
Protocols for Designing a Fast and Perfect Group-Oriented Secret Key Sharing in Distributed Systems
Found in: Parallel Architectures, Algorithms, and Networks, International Symposium on
By Woei-Jiunn Tsaur, Shi-Jinn Horng
Issue Date:June 1996
pp. 326
This paper presents a fast and perfect secret key sharing scheme based on a simple geometric method to solve group-oriented secret sharing problems in distributed systems. This scheme does not need the existence of the trusted authority and can reduce the ...
 
Computing Dominators and Its Applications on Processor Arrays with Reconfigurable Bus Systems
Found in: Parallel Architectures, Algorithms, and Networks, International Symposium on
By Tzong-Wann Kao, Shi-Jinn Horng
Issue Date:June 1996
pp. 302
This paper makes an efficient improvement of processor complexity while solving some connectivity problems in processor arrays with reconfigurable bus systems. We first derive two constant time algorithms in the proposed parallel processing system for comp...
 
An authentication-combined access control scheme using a geometric approach in distributed systems
Found in: Proceedings of the 1997 ACM symposium on Applied computing (SAC '97)
By Chia-Ho Chen, Shi-Jinn Horng, Woei-Jiunn Tsaur
Issue Date:April 1997
pp. 361-365
This paper describes the effects of program restructuring in a dataflow environment. Previous studies showed that dataflow programs can exhibit locality and that a memory hierarchy is feasible in a dataflow environment. This study shows that the order in w...
     
 1