Browsing by Subject "Finite automata"

Now showing 1 - 7 of 7

Open Access
Design of trellis waveform coders with near-optimum structure
(IET, 1992) Kuruoglu, E.E.; Ayanoglu, E.
In this Letter the combinatorial optimisation algorithm known as simulated annealing is used for the optimisation of the trellis structure of the next-state map of the decoder finite-state machine in trellis waveform coding. The generalised Lloyd algorithm which finds the optimum codebook is incorporated into simulated annealing so that near-optimum coding systems are designed. Comparison of simulation results with previous work in the literature shows that this method yields better coding systems than those published in the literature.
Open Access
Keyframe labeling technique for surveillance event classification
(S P I E - International Society for Optical Engineering, 2010) Şaykol, E.; Baştan M.; Güdükbay, Uğur; Ulusoy, Özgür
The huge amount of video data generated by surveillance systems necessitates the use of automatic tools for their efficient analysis, indexing, and retrieval. Automated access to the semantic content of surveillance videos to detect anomalous events is among the basic tasks; however, due to the high variability of the audio-visual features and large size of the video input, it still remains a challenging task, though a considerable amount of research dealing with automated access to video surveillance has appeared in the literature. We propose a keyframe labeling technique, especially for indoor environments, which assigns labels to keyframes extracted by a keyframe detection algorithm, and hence transforms the input video to an event-sequence representation. This representation is used to detect unusual behaviors, such as crossover, deposit, and pickup, with the help of three separate mechanisms based on finite state automata. The keyframes are detected based on a grid-based motion representation of the moving regions, called the motion appearance mask. It has been shown through performance experiments that the keyframe labeling algorithm significantly reduces the storage requirements and yields reasonable event detection and classification performance. © 2010 Society of Photo-Optical Instrumentation Engineers.
Open Access
Kinect based intelligent wheelchair navigation with potential fields
(IEEE, 2014) Özçelikörs, M.; Çoşkun, A.; Say, M. Girayhan; Yazici, A.; Yayan, U.; Akçakoca, M.
Increasing elderly people population and people with disabilities constitute a huge demand for wheelchairs. Wheelchairs have an important role on improving the lives and mobilization of people with disabilities. Moreover, autonomous wheelchairs constitute a suitable research platform for academic and industrial researchers. In this study, Finite state machine (FSM) based high-level controller and Kinect based navigation algorithm have been developed for ATEKS (Intelligent Wheelchair) which has high-tech control mechanisms, low-cost sensors and open source software (ROS, GAZEBO, ANDROID). © 2014 IEEE.
Open Access
Test case verification by model checking
(Kluwer Academic Publishers, 1993) Naik, K.; Sarikaya, B.
Verification of a test case for testing the conformance of protocol implementations against the formal description of the protocol involves verifying three aspects of the test case: expected input/output test behavior, test verdicts, and the test purpose. We model the safety and liveness properties of a test case using branching time temporal logic. There are four types of safety properties: transmission safety, reception safety, synchronization safety, and verdict safety. We model a test purpose as a liveness property and give a set of notations to formally specify a test purpose. All these properties expressed as temporal formulas are verified using model checking on an extended state machine graph representing the composed behavior of a test case and protocol specification. This methodology is shown to be effective in finding errors in manually developed conformance test suites. © 1993 Kluwer Academic Publishers.
Open Access
Testing communication protocols
(1992) Naik, K.; Sarıkaya, B.
[No abstract available]
Open Access
Verification of protocol conformance test cases using reachability analysis
(Elsevier Inc., 1992) Naik, K.; Sarikaya, Behcet
A methodology is presented to verify manually written test cases against the formal specification of a protocol. Initially, a protocol and a test case are modeled as nondeterministic finite state machines and test case verification is viewed as a reachability analysis problem. An existing reachability analysis algorithm, based on the well-known perturbation technique, is modified to take nondeterminism in protocols and special test case features (timeouts and OTHERWISE events) into account. Correctness aspects of the reachability algorithm are proved. The notion of a synchronization error manifesting in a test case due to the nondeterministic nature of a protocol specification is studied. To verify data flow aspects of test cases, we extend our technique by modeling the test case and protocol specification as extended finite state machines. A test case from a proprietary test suite for the transport protocol Class 2 is taken as an example and is shown to contain several design errors.
Open Access
Vision-based single-stroke character recognition for wearable computing
(IEEE, 2001) Özer, Ö. F.; Özün, O.; Tüzel, C. Ö.; Atalay, V.; Çetin, A. Enis
Particularly when compared to traditional tools such as a keyboard or mouse, wearable computing data entry tools offer increased mobility and flexibility. Such tools include touch screens, hand gesture and facial expression recognition, speech recognition, and key systems. We describe a new approach for recognizing characters drawn by hand gestures or by a pointer on a user's forearm captured by a digital camera. We draw each character as a single, isolated stroke using a Graffiti-like alphabet. Our algorithm enables effective and quick character recognition. The resulting character recognition system has potential for application in mobile communication and computing devices such as phones, laptop computers, handheld computers and personal data assistants.