Circular barcode design resistant to linear motion blur (preliminary slides)

Nbsingh csir-ceeri-semiconductor-activities

Narendra Bahadur Singh

4 camera cctv quotation bangladesh

For the full video of this presentation, please visit: http://www.embedded-vision.com/platinum-members/nvidia/embedded-vision-training/videos/pages/may-2016-embedded-vision-summit-gallo For more information about embedded vision, please visit: http://www.embedded-vision.com Orazio Gallo, Senior Research Scientist at NVIDIA, presents the "Computational Photography: Understanding and Expanding the Capabilities of Standard Cameras" tutorial at the May 2016 Embedded Vision Summit. Today's digital cameras, even at the entry-level, produce pictures with quality comparable to that of high-end cameras of a decade ago. Image processing and computational photography algorithms play a significant role in this improvement. In this talk, Orazio explains the algorithmic processing that cameras perform to produce high-quality images and how this processing interplays with computer vision algorithms. He then discusses algorithms that expand the capabilities of standard cameras by allowing more accurate measurements or new applications.

The Benefits of Sony Video Security Solutions_Aug_2012_4 - Global - Edited 19...

Chapter Eight

Nada G.Youssef

Droidcon2013 triangles gangolells_imaginationDroidcon Berlin

HD CCTV BACOM SOLUTION.pptx

Chapter 8 Video

shelly3160

Linovision catalog version 2014 aug

linovision

IoT consideration selection

Yoss Cohen

Industrial Technology Multimedia Video Theory Prelim Course

jliang2145

Mx Presentation En 2008

Nour Al-Shakhouri

Why ip060810

Design of VGA Controller using VHDL for LCD Display using FPGA

IJMER

Basically, here I have used VGA for implementing basic characters/Symbols that can be either used in advertisements that deals with real-time application. So, I thought of using VGA as a standard for this implementation as it is the basic graphics array and compatible with other graphical arrays. This project also describes about the design of VGA (Video Graphic Array) Controller using combination of three bit input data to control eight differences colors to display text at monitor by using on board pushbuttons for the input. Three color signal referred to collectively as R (red), G (green) and B (blue) signal(i.e. RGB). The VGA monitor using resolution of 640 by 480 by mode to display Characters/Text/Images in different colors. Here, we used VHDL language on Xilinx ISE software for interfacing the required peripheral to the Xilinx FPGA Spartan Series. Where, I implementing the application of VGA with the help of VHDL language on Xilinx FPGA, that will contain the logic part. For Simulation part we are using Modelsim 10.2. Finally, the results that we obtained for VGA application implementation.

Training Videovigilancia IP: What, Why, When and How

Nestor Carralero

MPEG-1 Part 2 Video Encoding

Christian Kehl

Sd5 recorderpresentation

16 camera cctv quotation bangladesh

16 camera cctv quotation bangladeshJamField Solution

8 camera cctv quotation bangladesh

(Paper) An Endorsement Based Mobile Payment System for a Disaster Area

Babatunde Ojetunde, Naoki Shibata, Juntao Gao, and Minoru Ito : An Endorsement Based Mobile Payment System for A Disaster Area, in Proc. of The 29th IEEE International Conference on Advanced Information Networking and Applications (AINA-2015) (29% acceptance rate), pp.482-489, Mar. 2015. DOI:10.1109/AINA.2015.225 A payment system in a disaster area is essential for people to buy necessities such as groceries, clothing, and medical supplies. However, existing payment systems require the needed communication infrastructures (like wired networks and cellular networks) to enable transactions, so that these systems cannot be relied on in disaster areas, where these communication infrastructures may be destroyed. In this paper, we propose a mobile payment system, adopting infrastructureless mobile adhoc networks (MANETs), which allow users to shop in disaster areas while providing secure transactions. Specifically, we propose an endorsement-based scheme to guarantee each transaction and a scheme to provide monitoring based on location information, and thus achieve transaction validity and reliability. Our mobile payment system can also prevent collusion between two parties and reset and recover attacks by any user. Security is ensured by using location-based mutual monitoring by nearby users, avoiding thereby double spending in the system.

BalloonNet: A Deploying Method for a Three-Dimensional Wireless Network Surro...

Aiming at fast establishment of a wireless network around a multi-level building in a disaster area, we propose an efficient method to determine the locations of network nodes in the air. Nodes are attached to balloons outside a building and deployed in the air so that the network can be accessed from anywhere in the building. In this paper, we introduce an original radio propagation model for predicting path loss from an outdoor position to a position inside a building. In order to address the three-dimensional deployment problem, the proposed method optimizes an objective function for satisfying two goals: (1) guarantee the coverage: the target space needs to be covered by over a certain percentage by wireless network nodes, (2) minimize the number of network nodes. For solving this problem, we propose an algorithm based on a genetic algorithm. To evaluate the proposed method, we compared our method with three benchmark methods, and the results show that the proposed method requires fewer nodes than other methods.

Similar to Circular barcode design resistant to linear motion blur (preliminary slides)

4 camera cctv quotation www.unicodebd.com

Edge AI and Vision Alliance

GPU

Frya Lora

"Computational Photography: Understanding and Expanding the Capabilities of S...

The Benefits of Sony Video Security Solutions_Aug_2012_4 - Global - Edited 19...

Chapter Eight

Nada G.Youssef

Droidcon2013 triangles gangolells_imaginationDroidcon Berlin

HD CCTV BACOM SOLUTION.pptx

Chapter 8 Video

shelly3160

Linovision catalog version 2014 aug

linovision

IoT consideration selection

Yoss Cohen

Industrial Technology Multimedia Video Theory Prelim Course

jliang2145

Mx Presentation En 2008

Nour Al-Shakhouri

Why ip060810

Design of VGA Controller using VHDL for LCD Display using FPGA

IJMER

Training Videovigilancia IP: What, Why, When and How

Nestor Carralero

MPEG-1 Part 2 Video Encoding

Christian Kehl

Sd5 recorderpresentation

16 camera cctv quotation bangladesh

16 camera cctv quotation bangladeshJamField Solution

8 camera cctv quotation bangladesh

Similar to Circular barcode design resistant to linear motion blur (preliminary slides) (20)

4 camera cctv quotation www.unicodebd.com

GPU

"Computational Photography: Understanding and Expanding the Capabilities of S...

The Benefits of Sony Video Security Solutions_Aug_2012_4 - Global - Edited 19...

Chapter Eight

Droidcon2013 triangles gangolells_imagination

HD CCTV BACOM SOLUTION.pptx

Chapter 8 Video

Linovision catalog version 2014 aug

IoT consideration selection

Industrial Technology Multimedia Video Theory Prelim Course

Mx Presentation En 2008

Why ip060810

Design of VGA Controller using VHDL for LCD Display using FPGA

Training Videovigilancia IP: What, Why, When and How

MPEG-1 Part 2 Video Encoding

Sd5 recorderpresentation

16 camera cctv quotation bangladesh

8 camera cctv quotation bangladesh

More from Naoki Shibata

(Paper) An Endorsement Based Mobile Payment System for a Disaster Area

BalloonNet: A Deploying Method for a Three-Dimensional Wireless Network Surro...

Congestion Alleviation Scheduling Technique for Car Drivers Based on Predicti...

In arranging efficient touring to various areas in urban areas, taking into account potential congestion is needed in order to schedule the order of these visits it is important to on the roads used and at the places to be visited. A number of scheduling methods have been proposed for finding (1) a noncongested route by sharing route information among users, or (2) a schedule to alleviate congestion at specific places based on the latest congestion information. However, these methods do not suffice since they do not deal with, simultaneously, congestion on road and at sites visited. In this paper, we propose a method of finding schedules for thousands of users by predicting, in advance, both types of congestion. Using the predicted results, the method adjusts each user’s provisional schedule by changing visiting order of places, and reducing their number in keeping with each user’s preferences. We have implemented the proposed method and evaluated it by simulations. The results showed it to achieve higher user satisfaction than existing methods.

(Paper) MTcast: Robust and Efficient P2P-based Video Delivery for Heterogeneo...

In this paper, we propose a new video delivery method called MTcast (Multiple Transcode based video multicast) which achieves efficient simultaneous video delivery to multiple users with different quality requirements by relying on user nodes to transcode and forward video to other user nodes. In MTcast, each user specifies a quality requirement for a video consisting of bitrate, picture size and frame rate based on the user’s environmental resource limitation. All users can receive video with the specified quality (or near this quality) along a single delivery tree. The main characteristics of MTcast are in its scalability, high user satisfaction degree in received video quality, short startup latency and robustness against node failure. Through simulations, we have confirmed that MTcast can achieve much higher user satisfaction degree and robustness against node failure than the layered multicast method.

An Endorsement Based Mobile Payment System for A Disaster Area

Babatunde Ojetunde, Naoki Shibata, Juntao Gao, and Minoru Ito : An Endorsement Based Mobile Payment System for A Disaster Area, to appear in Proc. of The 29th IEEE International Conference on Advanced Information Networking and Applications (AINA-2015), Mar. 2015. A payment system in a disaster area is essential for people to buy necessities such as groceries, clothing, and medical supplies. However, existing payment systems require the needed communication infrastructures (like wired networks and cellular networks) to enable transactions, so that these systems cannot be relied on in disaster areas, where these communication infrastructures may be destroyed. In this paper, we propose a mobile payment system, adopting infrastructureless mobile adhoc networks (MANETs), which allow users to shop in disaster areas while providing secure transactions. Specifically, we propose an endorsement-based scheme to guarantee each transaction and a scheme to provide monitoring based on location information, and thus achieve transaction validity and reliability. Our mobile payment system can also prevent collusion between two parties and reset and recover attacks by any user. Security is ensured by using location-based mutual monitoring by nearby users, avoiding thereby double spending in the system.

GreenSwirl: Combining Traffic Signal Control and Route Guidance for Reducing ...

Jiaxing Xu, Weihua Sun, Naoki Shibata and Minoru Ito : "GreenSwirl: Combining Traffic Signal Control and Route Guidance for Reducing Traffic Congestion," in Proc. of IEEE Vehicular Networking Conference 2014 (IEEE VNC 2014), pp. 179-186. Serious traffic congestion is a major social problem in large cities. Inefficient setting of traffic signal cycles, especially, is one of the main causes of congestion. GreenWave is a method for controlling traffic signals which allows one-way traffic to pass through a series of intersections without being stopped by a red light. GreenWave was tested in several cities around the world, but the results were not satisfactory. Two of the problems with GreenWave are that it still stops the crossing traffic, and it forms congestion in the traffic turning into or out of the crossing streets. To solve these problems, we propose a method of controlling traffic signals, GreenSwirl, in combination with a route guidance method, GreenDrive. GreenSwirl controls traffic signals to enable a smooth flow of traffic through signals times to turn green in succession and through non-stop circular routes through the city. The GreenWave technology is extended thereby. We also use navigation systems to optimize the overall control of the city's traffic. We did a simulation using the traffic simulator SUMO and the road network of Manhattan Island in New York. We confirmed that our method shortens the average travel time by 10%-60%, even when not all cars on the road are equipped to use this system.

Task Scheduling Algorithm for Multicore Processor Systems with Turbo Boost an...

Yosuke Wakisaka, Naoki Shibata, Keiichi Yasumoto, Minoru Ito, and Junji Kitamichi : Task Scheduling Algorithm for Multicore Processor Systems with Turbo Boost and Hyper-Threading, In Proc. of The 2014 International Conference on Parallel and Distributed Processing Techniques and Applications(PDPTA'14), pp. 229-235 In this paper, we propose a task scheduling algorithm for multiprocessor systems with Turbo Boost and Hyper-Threading technologies. The proposed algorithm minimizes the total computation time taking account of dynamic changes of the processing speed by the two technologies, in addition to the network contention among the processors. We constructed a clock speed model with which the changes of processing speed with Turbo Boost and Hyper-threading can be estimated for various processor usage patterns. We then constructed a new scheduling algorithm that minimizes the total execution time of a task graph considering network contention and the two technologies. We evaluated the proposed algorithm by simulations and experiments with a multiprocessor system consisting of 4 PCs. In the experiment, the proposed algorithm produced a schedule that reduces the total execution time by 36% compared to conventional methods which are straightforward extensions of an existing method.

GPGPU-Assisted Subpixel Tracking Method for Fiducial Markers

With an aim to realizing highly accurate position estimation, we propose in this paper a method for efficiently and accurately detecting the 3D positions and poses of traditional fiducial markers with black frames in high resolution images taken by ordinary web cameras. Our tracking method can be efficiently executed utilizing GPGPU computation, and in order to realize this, we devised a connected-component labeling method suitable for GPGPU execution. In order to improve accuracy, we devised a method for detecting 2D positions of the corners of markers in subpixel accuracy. We implemented our method in Java and OpenCL, and we confirmed that the proposed method provides better detection and measurement accuracy, and recognizing from high-resolution images is beneficial for improving accuracy. We also confirmed that our method is more than two times as fast as the existing method with CPU computation.

(Paper) BalloonNet: A Deploying Method for a Three-Dimensional Wireless Netwo...

(Paper) Emergency Medical Support System for Visualizing Locations and Vital ...

The triage tag is used in Mass Casualty Incident (MCI) to check the priority of patients treatments and conditions. However, it is difficult to grasp a change in the patient’s information since it is a paper tag. In this paper, we propose a system using the electronic triage tag (eTriage) that facilitates emergency medical technicians to grasp patients locations and conditions through visualization. This system provides the following three views of the patients information: (1) Inter-site view which shows on a map an overview of the latest status in multiple first-aid stations including the number of technicians and patients of each triage category; (2) Intra-site view which shows detailed status of each first-aid station including the location, triage category, and vital signs of each patient on a 3D map created based on the environment mapping technique; and (3) Individual view which shows vital information of patients on a tablet PC according to its orientation using the augmented reality technique. In this paper, we describe the design and implementation of the proposed system with some preliminary evaluation results.

(Paper) A Method for Overlay Network Latency Estimation from Previous Observa...

Weihua Sun, Naoki Shibata, Keiichi Yasumoto, Masaaki Mori, "A Method for Overlay Network Latency Estimation from Previous Observation", in Proc. of The Twelfth International Conference on Networks (ICN2013), pp.95--100, 29 Jan. 2013. Abstract—Estimation of the qualities of overlay links is useful for optimizing overlay networks on the Internet. Existing estimation methods requires sending large quantities of probe packets between two nodes, and the software for measurements have to be executed at both of the end nodes. Accurate measurements require many probe packets to be sent, and other communication can be disrupted by significantly increased network traffic. In this paper, we propose a link quality estimation method based on supervised learning from the previous observation of other similar links. Our method does not need to exchange probe packets, estimation can be quickly made to know qualities of many overlay links without wasting bandwidth and processing time on many nodes. We conducted evaluation of our method on PlanetLab, and our method showed better performance on path latency estimation than estimating results from geographical distance between the two end nodes.

(Paper) Parking Navigation for Alleviating Congestion in Multilevel Parking F...

Kenmotsu, M., Sun, W., Shibata, N., Yasumoto, K. and Ito, M. : "Parking Navigation for Alleviating Congestion in Multilevel Parking Facility," Proc. of 2012 IEEE 76th Vehicular Technology Conference (VTC2012-Fall), Sep.2012. Abstract - Finding a vacant parking space in a large crowded parking facility takes long time. In this paper, we propose a navigation method that minimizes the parking time based on collected real-time positional information of cars. In the proposed method, a central server in the parking facility collects the information and estimates the occupancy of each parking zone. Then, the server broadcasts the occupancy data to the cars in the parking facility. Each car then computes a parking route with the shortest expected parking waiting time and shows it to the driver. We conducted simulation-based evaluations of the proposed method using a realistic model based on trace data taken from a real parking facility. We confirmed that the proposed method reduced parking waiting time by 20%–70% even with low system penetration.

(Paper) Self adaptive island GA

Takashima, E.,Murata, Y., Shibata, N., Ito, M.: Self Adaptive Island GA, Proceedings of 2003 Congress on Evolutionary Computation (CEC 2003), Vol.2, pp.1072-1079, DOI:10.1109/CEC.2003.1299787 http://ito-lab.naist.jp/themes/pdffiles/031209.eiichi-t.cec2003.pdf Exploration efficiency of GAs largely depends on parameter values. But, it is hard to manually adjust these values. T o cope with this problem, several adaptive GAs which automatically adjust parameters have been proposed. However , most of the existing adaptive GAs can adapt only a few parameters at the same time. Al-though several adaptive GAs can adapt multiple param-eters simultaneously , these algorithms require extremely large computation costs. In this paper , we propose Self Adaptive Island GA(SAIGA) which adapts four param-eter values simultaneously while finding a solution to a problem. SAIGA is a kind of island GA, and it adapts parameter values using a similar mechanism to meta-GA. Throughout our evaluation experiments, we con-firmed that our algorithm outperforms a simple GA us-ing De Jong's rational parameters, and has performance close to a simple GA using manually tuned parameter values.

(Paper) Efficient Evaluation Methods of Elementary Functions Suitable for SIM...

Naoki Shibata : Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation, Journal of Computer Science on Research and Development, Proceedings of the International Supercomputing Conference ISC10., Volume 25, Numbers 1-2, pp. 25-32, DOI:10.1007/s00450-010-0108-2 (May. 2010). http://ito-lab.naist.jp/~n-sibata/pdfs/isc10simd.pdf http://freecode.com/projects/sleef Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Although some SIMD and SIMT instruction sets include double-precision arithmetic and bitwise operations, there are no instructions dedicated to evaluating elementary functions like trigonometric functions in double precision. Thus, these functions have to be evaluated one by one using an FPU or using a software library. However, traditional algorithms for evaluating these elementary functions involve heavy use of conditional branches and/or table look-ups, which are not suitable for SIMD computation. In this paper, efficient methods are proposed for evaluating the sine, cosine, arc tangent, exponential and logarithmic functions in double precision without table look-ups, scattering from, or gathering into SIMD registers, or conditional branches. We implemented these methods using the Intel SSE2 instruction set to evaluate their accuracy and speed. The results showed that the average error was less than 0.67 ulp, and the maximum error was 6 ulps. The computation speed was faster than the FPUs on Intel Core 2 and Core i7 processors.

(Slides) A Decentralized Method for Maximizing k-coverage Lifetime in WSNs

Katsuma, R., Murata, Y., Shibata, N., Yasumoto, K., Ito, M.: "A Decentralized Method for Maximizing k-coverage Lifetime in WSNs," Proc. of The Sixth International Conference on Mobile Computing and Ubiquitous Networking (ICMU 2012), pp.16-23, May.23, 2012. http://ito-lab.naist.jp/mediawiki/images/1/17/Icmu2012.pdf In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting other nodes in sleep. We divide a target field into multiple grids and make nodes in each grid locally achieve k-coverage. We can reduce energy consumption of WSN by minimizing the number of active nodes required for kcoverage. However, coverage degree is likely to go to excess beyond k near border between grids when deciding active nodes in each grid independently. To solve this problem, our method decides the minimal set of active nodes for adjoined grids at different times so that k-coverage of a grid is achieved taking into account the coverage in its neighboring grids. Through computer simulations, we confirmed that the proposed method achieved distribution of WSN processing with a small decrease of k-coverage lifetime compared to the centralized algorithm.

(Paper) Task scheduling algorithm for multicore processor system for minimiz...

Shohei Gotoda, Naoki Shibata and Minoru Ito : "Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault," Proceedings of IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2012), pp.260-267, DOI:10.1109/CCGrid.2012.23, May 15, 2012. In this paper, we propose a task scheduling al-gorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore processor. Many of the recently developed processors have multiple cores on a single die, so that one failure of a computing node results in failure of many processors. In the case of a failure of a multicore processor, all tasks which have been executed on the failed multicore processor have to be recovered at once. The proposed algorithm is based on an existing checkpointing technique, and we assume that the state is saved when nodes send results to the next node. If a series of computations that depends on former results is executed on a single die, we need to execute all parts of the series of computations again in the case of failure of the processor. The proposed scheduling algorithm tries not to concentrate tasks to processors on a die. We designed our algorithm as a parallel algorithm that achieves O(n) speedup where n is the number of processors. We evaluated our method using simulations and experiments with four PCs. We compared our method with existing scheduling method, and in the simulation, the execution time including recovery time in the case of a node failure is reduced by up to 50% while the overhead in the case of no failure was a few percent in typical scenarios.

(Slides) Task scheduling algorithm for multicore processor system for minimiz...

(Slides) A Technique for Information Sharing using Inter-Vehicle Communicatio...

Shinkawa, T., Terauchi, T., Kitani, T., Shibata, N., Yasumoto, K., Ito, M. and Higashino, T.: A Technique for Information Sharing using Inter-Vehicle Communication with Message Ferrying, International Workshop on Future Mobile and Ubiquitous Information Technologies (FMUIT'06). http://mimi.naist.jp/~yasumoto/papers/FMUIT2006-shinkawa.pdf In this paper, we propose a method to realize traffic information sharing among cars using inter-vehicle communication. When traffic information on a target area is retained by ordinary cars near the area, the information may be lost when the density of cars becomes low. In our method, we use the message ferrying technique together with the neighboring broadcast to mitigate this problem. We use buses which travel through regular routes as ferries. We let buses maintain the traffic information statistics in each area received from its neighboring cars. We implemented the proposed system, and conducted performance evaluation using traffic simulator NETSTREAM. As a result, we have confirmed that the proposed method can achieve better performance than using only neighboring broadcast.

(Slides) A Personal Navigation System with a Schedule Planning Facility Based...

Shiraishi, T., Nagata, M., Shibata, N., Murata, Y., Yasumoto, K. and Ito, M.: A Personal Navigation System with a Schedule Planning Facility Based on Multiobjective Criteria, Proceedings of the 2nd International Conference on Mobile Computing and Ubiquitous Networking (ICMU2005), pp.104-109, (April 2005) http://ito-lab.naist.jp/themes/pdffiles/icmu05-takayu-s.pdf In our previous work, we have proposed a personal navigation system called P-Tour, which facilitates tourists to compose a schedule to visit multiple destinations taking into account their preferences and time restrictions. In this paper, we extend P-Tour in the following two ways: (1) allowing users to optimize their tour schedules under multiple conflicting criteria such as total expenses and satisfaction degrees; and (2) navigating users to the next destination in more efficient way. We have implemented the above extensions and integrated them into P-Tour. Through some experiments, we show the effectiveness of the proposed extensions.

(Slides) A Method for Distributed Computaion of Semi-Optimal Multicast Tree i...